ORIGAMI

A novel and effective approach for mining representative orthogonal graph patterns

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

Research output: Contribution to journalArticle

36 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 α-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 where existing enumerative graph mining methods fail to do so.

Original languageEnglish
Pages (from-to)67-84
Number of pages18
JournalStatistical Analysis and Data Mining
Volume1
Issue number2
DOIs
Publication statusPublished - 1 Jun 2008
Externally publishedYes

Fingerprint

Mining
Graph in graph theory
Graph Mining
Randomized Algorithms
Minimise

Keywords

  • Graph mining
  • Maximal pattern mining
  • Randomized algorthims

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Analysis

Cite this

ORIGAMI : A novel and effective approach for mining representative orthogonal graph patterns. / Chaoji, Vineet; Hasan, Mohammad Al; Salem, Saeed; Besson, Jeremy; Zaki, Mohammed J.

In: Statistical Analysis and Data Mining, Vol. 1, No. 2, 01.06.2008, p. 67-84.

Research output: Contribution to journalArticle

Chaoji, Vineet ; Hasan, Mohammad Al ; Salem, Saeed ; Besson, Jeremy ; Zaki, Mohammed J. / ORIGAMI : A novel and effective approach for mining representative orthogonal graph patterns. In: Statistical Analysis and Data Mining. 2008 ; Vol. 1, No. 2. pp. 67-84.
@article{8a402b3f7549488ebe68a6885158a009,
title = "ORIGAMI: A novel and effective approach for 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 α-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 where existing enumerative graph mining methods fail to do so.",
keywords = "Graph mining, Maximal pattern mining, Randomized algorthims",
author = "Vineet Chaoji and Hasan, {Mohammad Al} and Saeed Salem and Jeremy Besson and Zaki, {Mohammed J.}",
year = "2008",
month = "6",
day = "1",
doi = "10.1002/sam.10004",
language = "English",
volume = "1",
pages = "67--84",
journal = "Statistical Analysis and Data Mining",
issn = "1932-1872",
publisher = "John Wiley and Sons Inc.",
number = "2",

}

TY - JOUR

T1 - ORIGAMI

T2 - A novel and effective approach for mining representative orthogonal graph patterns

AU - Chaoji, Vineet

AU - Hasan, Mohammad Al

AU - Salem, Saeed

AU - Besson, Jeremy

AU - Zaki, Mohammed J.

PY - 2008/6/1

Y1 - 2008/6/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 α-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 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 α-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 where existing enumerative graph mining methods fail to do so.

KW - Graph mining

KW - Maximal pattern mining

KW - Randomized algorthims

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

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

U2 - 10.1002/sam.10004

DO - 10.1002/sam.10004

M3 - Article

VL - 1

SP - 67

EP - 84

JO - Statistical Analysis and Data Mining

JF - Statistical Analysis and Data Mining

SN - 1932-1872

IS - 2

ER -