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

49 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 - IEEE International Conference on Data Mining, ICDM
Pages153-162
Number of pages10
DOIs
Publication statusPublished - 1 Dec 2007
Externally publishedYes
Event7th IEEE International Conference on Data Mining, ICDM 2007 - Omaha, NE, United States
Duration: 28 Oct 200731 Oct 2007

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)

Cite this

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

ORIGAMI : Mining representative orthogonal graph patterns. / Hasan, Mohammad Al; Chaoji, Vineet; Salem, Saeed; Besson, Jeremy; Zaki, Mohammed J.

Proceedings - IEEE International Conference on Data Mining, ICDM. 2007. p. 153-162 4470239.

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

Hasan, MA, Chaoji, V, Salem, S, Besson, J & Zaki, MJ 2007, ORIGAMI: Mining representative orthogonal graph patterns. in Proceedings - IEEE International Conference on Data Mining, ICDM., 4470239, pp. 153-162, 7th IEEE International Conference on Data Mining, ICDM 2007, Omaha, NE, United States, 28/10/07. https://doi.org/10.1109/ICDM.2007.45
Hasan MA, Chaoji V, Salem S, Besson J, Zaki MJ. ORIGAMI: Mining representative orthogonal graph patterns. In Proceedings - IEEE International Conference on Data Mining, ICDM. 2007. p. 153-162. 4470239 https://doi.org/10.1109/ICDM.2007.45
Hasan, Mohammad Al ; Chaoji, Vineet ; Salem, Saeed ; Besson, Jeremy ; Zaki, Mohammed J. / ORIGAMI : Mining representative orthogonal graph patterns. Proceedings - IEEE International Conference on Data Mining, ICDM. 2007. pp. 153-162
@inproceedings{7fd2b814060d44b0bc0851116a7083f9,
title = "ORIGAMI: Mining representative orthogonal graph patterns",
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.",
author = "Hasan, {Mohammad Al} and Vineet Chaoji and Saeed Salem and Jeremy Besson and Zaki, {Mohammed J.}",
year = "2007",
month = "12",
day = "1",
doi = "10.1109/ICDM.2007.45",
language = "English",
isbn = "0769530184",
pages = "153--162",
booktitle = "Proceedings - IEEE International Conference on Data Mining, ICDM",

}

TY - GEN

T1 - ORIGAMI

T2 - Mining representative orthogonal graph patterns

AU - Hasan, Mohammad Al

AU - Chaoji, Vineet

AU - Salem, Saeed

AU - Besson, Jeremy

AU - Zaki, Mohammed J.

PY - 2007/12/1

Y1 - 2007/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=49749107567&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=49749107567&partnerID=8YFLogxK

U2 - 10.1109/ICDM.2007.45

DO - 10.1109/ICDM.2007.45

M3 - Conference contribution

SN - 0769530184

SN - 9780769530185

SP - 153

EP - 162

BT - Proceedings - IEEE International Conference on Data Mining, ICDM

ER -