In this paper, we introduce the concept of α-orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are a-orthogonal if their similarity is bounded above by α. Each a-orthogonal pattern is also a representative for those patterns that are at least β similar to it. Given user defined α, β ∈ [0,1], the goal is to mine an α-orthogonal, β-representative set that minimizes the set of unrepresented patterns. We present origami, an effective algorithm for mining the set of representative orthogonal patterns. origami first uses a randomized algorithm to randomly traverse the pattern space, seeking previously unexplored regions, to return a set of maximal patterns. origami then extracts an α-orthogonal, β-representative set from the mined maximal patterns. We show the effectiveness of our algorithm on a number of real and synthetic datasets. In particular, we show that our method is able to extract high quality patterns even in cases where existing enumerative graph mining methods fail to do so.