ORIGAMI: Mining representative orthogonal graph patterns

Mohammad Al Hasan, Vineet Chaoji, Saeed Salem, Jeremy Besson, Mohammed J. Zaki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

50 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the 7th IEEE International Conference on Data Mining, ICDM 2007
Pages153-162
Number of pages10
DOIs
Publication statusPublished - 1 Dec 2007
Event7th IEEE International Conference on Data Mining, ICDM 2007 - Omaha, NE, United States
Duration: 28 Oct 200731 Oct 2007

Publication series

NameProceedings - IEEE International Conference on Data Mining, ICDM
ISSN (Print)1550-4786

Other

Other7th IEEE International Conference on Data Mining, ICDM 2007
CountryUnited States
CityOmaha, NE
Period28/10/0731/10/07

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'ORIGAMI: Mining representative orthogonal graph patterns'. Together they form a unique fingerprint.

  • Cite this

    Hasan, M. A., Chaoji, V., Salem, S., Besson, J., & Zaki, M. J. (2007). ORIGAMI: Mining representative orthogonal graph patterns. In Proceedings of the 7th IEEE International Conference on Data Mining, ICDM 2007 (pp. 153-162). [4470239] (Proceedings - IEEE International Conference on Data Mining, ICDM). https://doi.org/10.1109/ICDM.2007.45