Trend Mining in Dynamic Attributed Graphs

Many applications see huge demands of discovering important patterns in dynamic attributed graph. In this paper, we introduce the problem of discovering trend sub-graphs in dynamic attributed graphs. This new kind of pattern relies on the graph structure and the temporal evolution of the attribute values. Several interestingness measures are introduced to focus on the most relevant patterns with regard to the graph structure, the vertex attributes, and the time. We design an efficient algorithm that benefits from various constraint properties and provide an extensive empirical study from several real-world dynamic attributed graphs.

[1]  Jean-François Boulicaut,et al.  Discovering descriptive rules in relational dynamic graphs , 2013, Intell. Data Anal..

[2]  Thomas Seidl,et al.  Tracing clusters in evolving graphs with node attributes , 2012, CIKM '12.

[3]  Ruoming Jin,et al.  Trend Motif: A Graph Mining Approach for Analysis of Dynamic Complex Networks , 2007, Seventh IEEE International Conference on Data Mining (ICDM 2007).

[4]  瀬々 潤,et al.  Traversing Itemset Lattices with Statistical Metric Pruning (小特集 「発見科学」及び一般演題) , 2000 .

[5]  Jean-François Boulicaut,et al.  Cohesive Co-evolution Patterns in Dynamic Attributed Graphs , 2012, Discovery Science.

[6]  Marc Plantevit,et al.  Mining Graph Topological Patterns: Finding Covariations among Vertex Descriptors , 2013, IEEE Transactions on Knowledge and Data Engineering.

[7]  Takeaki Uno,et al.  An Efficient Algorithm for Solving Pseudo Clique Enumeration Problem , 2008, Algorithmica.

[8]  Aristides Gionis,et al.  Mining Graph Evolution Rules , 2009, ECML/PKDD.

[9]  Mohammed J. Zaki,et al.  Mining Attribute-structure Correlated Patterns in Large Attributed Graphs , 2012, Proc. VLDB Endow..

[10]  Tanya Y. Berger-Wolf,et al.  Mining Periodic Behavior in Dynamic Social Networks , 2008, 2008 Eighth IEEE International Conference on Data Mining.

[11]  Hans-Peter Kriegel,et al.  Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering , 2009, TKDD.

[12]  Jean-François Boulicaut,et al.  Closed patterns meet n-ary relations , 2009, TKDD.

[13]  Shinichi Morishita,et al.  Transversing itemset lattices with statistical metric pruning , 2000, PODS '00.

[14]  Lawrence B. Holder,et al.  Learning patterns in the dynamics of biological networks , 2009, KDD.

[15]  Takashi Washio,et al.  Mining Frequent Graph Sequence Patterns Induced by Vertices , 2010, SDM.

[16]  Peter A. Flach,et al.  Evaluation Measures for Multi-class Subgroup Discovery , 2009, ECML/PKDD.

[17]  Céline Robardet,et al.  Constraint-Based Pattern Mining in Dynamic Graphs , 2009, 2009 Ninth IEEE International Conference on Data Mining.

[18]  Sergei O. Kuznetsov,et al.  On stability of a formal concept , 2007, Annals of Mathematics and Artificial Intelligence.

[19]  Hans-Peter Kriegel,et al.  Pattern Mining in Frequent Dynamic Subgraphs , 2006, Sixth International Conference on Data Mining (ICDM'06).

[20]  George Karypis,et al.  Algorithms for mining the evolution of conserved relational states in dynamic networks , 2011, 2011 IEEE 11th International Conference on Data Mining.

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