Weighted Path as a Condensed Pattern in a Single Attributed DAG

Directed acyclic graphs can be used across many application domains. In this paper, we study a new pattern domain for supporting their analysis. Therefore, we propose the pattern language of weighted paths, primitive constraints that enable to specify their relevancy (e.g., frequency and compactness constraints), and algorithms that can compute the specified collections. It leads to a condensed representation setting whose efficiency and scalability are empirically studied.

[1]  Mark Levene,et al.  A fine grained heuristic to capture web navigation patterns , 2000, SKDD.

[2]  Martin Ester,et al.  Mining Cohesive Patterns from Graphs with Feature Vectors , 2009, SDM.

[3]  Nazha Selmaoui-Folcher,et al.  How to Use "Classical" Tree Mining Algorithms to Find Complex Spatio-Temporal Patterns? , 2011, DEXA.

[4]  Tomonobu Ozaki,et al.  Frequent Pattern Discovery from a Single Graph with Quantitative Itemsets , 2009, 2009 IEEE International Conference on Data Mining Workshops.

[5]  Hisashi Kashima,et al.  Finding Itemset-Sharing Patterns in a Large Itemset-Associated Graph , 2010, PAKDD.

[6]  Lawrence B. Holder,et al.  Substructure Discovery Using Minimum Description Length and Background Knowledge , 1993, J. Artif. Intell. Res..

[7]  Christian Borgelt,et al.  Support Computation for Mining Frequent Subgraphs in a Single Graph , 2007, MLG.

[8]  Jean-François Boulicaut,et al.  A Survey on Condensed Representations for Frequent Sets , 2004, Constraint-Based Mining and Inductive Databases.

[9]  Yannis Manolopoulos,et al.  Mining patterns from graph traversals , 2001, Data Knowl. Eng..

[10]  Ehud Gudes,et al.  Discovering Frequent Graph Patterns Using Disjoint Paths , 2006, IEEE Transactions on Knowledge and Data Engineering.

[11]  Jiawei Han,et al.  gSpan: graph-based substructure pattern mining , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[12]  Kimmo Hätönen,et al.  Constraint-Based Mining and Inductive Databases , 2006 .

[13]  Takashi Washio,et al.  An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data , 2000, PKDD.

[14]  Nicolas Pasquier,et al.  Discovering Frequent Closed Itemsets for Association Rules , 1999, ICDT.

[15]  Jean-François Boulicaut,et al.  Data Peeler: Contraint-Based Closed Pattern Mining in n-ary Relations , 2008, SDM.

[16]  Jean-François Boulicaut,et al.  Constrained-Based Closed Pattern Mining in n-ary Relations , 2008 .

[17]  Tadashi Horiuchi,et al.  Extension of Graph-Based Induction for General Graph Structured Data , 2000, PAKDD.

[18]  Jiawei Han,et al.  CloseGraph: mining closed frequent graph patterns , 2003, KDD '03.

[19]  Nazha Selmaoui-Folcher,et al.  Modélisation de la dynamique de phénomènes spatio-temporels par des séquences de motifs , 2011, EGC.

[20]  Christian Borgelt,et al.  Mining molecular fragments: finding relevant substructures of molecules , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[21]  George Karypis,et al.  Finding Frequent Patterns in a Large Sparse Graph* , 2005, Data Mining and Knowledge Discovery.

[22]  S YuPhilip,et al.  Efficient Data Mining for Path Traversal Patterns , 1998 .

[23]  Luc De Raedt,et al.  Constraint-Based Mining and Inductive Databases, European Workshop on Inductive Databases and Constraint Based Mining, Hinterzarten, Germany, March 11-13, 2004, Revised Selected Papers , 2005, Constraint-Based Mining and Inductive Databases.

[24]  Runian Geng,et al.  WTPMiner: Efficient Mining of Weighted Frequent Patterns Based on Graph Traversals , 2007, KSEM.

[25]  George Karypis,et al.  Finding Frequent Patterns in a Large Sparse Graph* , 2004, IEEE International Parallel and Distributed Processing Symposium.

[26]  Xifeng Yan,et al.  CloSpan: Mining Closed Sequential Patterns in Large Datasets , 2003, SDM.

[27]  Philip S. Yu,et al.  Efficient Data Mining for Path Traversal Patterns , 1998, IEEE Trans. Knowl. Data Eng..

[28]  Siegfried Nijssen,et al.  What Is Frequent in a Single Graph? , 2007, PAKDD.

[29]  Alexandre Termier,et al.  DIGDAG, a First Algorithm to Mine Closed Frequent Embedded Sub-DAGs , 2007, MLG.

[30]  Takashi Washio,et al.  State of the art of graph-based data mining , 2003, SKDD.