ORIGAMI : a novel and effective approach for mining representative orthogonal graph patterns - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Statitistical Analysis and Data Mining Année : 2008

ORIGAMI : a novel and effective approach for mining representative orthogonal graph patterns

Résumé

In this paper, we introduce the concept of alpha-orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are alpha-orthogonal if their similarity is bounded above by alpha. Each alpha-orthogonal pattern is also a representative for those patterns that are at least beta similar to it. Given user defined alpha and beta in [0, 1], the goal is to mine an alpha-orthogonal, beta-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 alpha-orthogonal, beta-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.

Dates et versions

hal-01511074 , version 1 (20-04-2017)

Identifiants

Citer

Vineet Chaoji, Mohammad Hasan, Saeed Salem, Jérémy Besson, Mohammed Zaki. ORIGAMI : a novel and effective approach for mining representative orthogonal graph patterns. Statitistical Analysis and Data Mining, 2008, 2, 1, pp.67-84. ⟨10.1002/sam.10004⟩. ⟨hal-01511074⟩
110 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More