ORIGAMI: Mining Representative Orthogonal Graph Patterns

In this paper, we introduce the concept of α-orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are α-orthogonal if their similarity is bounded above by α. Each α-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 ...

• Type: Conference
• Year: 2007
• Where: ICDM
• Authors: Mohammad Al Hasan, Vineet Chaoji, Saeed Salem, Jérémy Besson, Mohammed Javeed Zaki
• Keywords: Data Mining, Graph Patterns, ICDM 2007, Maximal Patterns, α-orthogonal Pattern