Mining frequent graph sequence patterns induced by vertices

Proceedings of the 10th SIAM International Conference on Data Mining, SDM 2010

Volumn , Issue , 2010, Pages 466-477

  Inokuchi, Akihiro ^a   Washio, Takashi ^a  

^a OSAKA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL DATASETS; EVOLVING GRAPHS; FREQUENT PATTERN MINING; FREQUENT SUBGRAPHS; GRAPH SEQUENCES; INDUCED SUBGRAPHS; LABELED GRAPHS; LONG SEQUENCES;

DATA MINING;

EID: 84874388877     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972801.41     Document Type: Conference Paper

References (18)

1. Michele Berlingerio, Francesco Bonchi, Bjorn Bringmann, and Aristides Gionis. Mining Graph Evolution Rules. Proc. of European Conference on Principles and Practice of Knowledge Discovery in Databases, pp. 115-130. (2009)
2. Karsten M. Borgwardt, Hans-Peter Kriegel, and Peter Wackersreuther. Pattern Mining in Frequent Dynamic Subgraphs. Proc. of International Conference on Data Mining, pp. 818-822. (2006)
3. Diane J. Cook, Lawrence B. Holder, Jeff Coble, and Joseph Potts. Graph-based Mining of Complex Data. Advanced Methods for Knowledge Discovery from Complex Data, pp. 75-93, 2005.
4. Diane J. Cook and Lawrence B. Holder. Mining Graph Data. Wiley-Interscience, (2006)
5. Enron Email Dataset, http://www.cs.cmu.edu/~enron/
6. Mathias Fiedler and Christian Borgelt. Subgraph Support in a Single Large Graph. Workshops Proc. of Workshop on Mining Graphs and Complex Structures, pp. 399-404. (2007)
7. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman. (1979)
8. Chris Godsil and Gordon Royle. Algebraic Graph Theory Springer, (2001)
9. Akihiro Inokuchi, Takashi Washio, and Hiroshi Motoda. An Apriori-based Algorithm for Mining Frequent Substructures from Graph Data. Proc. of European Conference on Principles of Data Mining and Knowledge Discovery, pp. 13-23. (2000)
10. Akihiro Inokuchi, Takashi Washio, Yoshio Nishimura, and Hiroshi Motoda. A Fast Algorithm for Mining Frequent Connected Subgraphs. IBM Research Report, RT0448. (2002)
11. Akihiro Inokuchi and Takashi Washio. A Fast Method to Mine Frequent Subsequences from Graph Sequence Data. Proc. of IEEE International Conference on Data Mining, pp. 303-312. (2008)
12. Jacek P. Kukluk, Lawrence B. Holder, and Diane J. Cook. Inference of Node Replacement Graph Grammars. Intelligent Data Analysis, Vol. 11, No. 4, pp. 377-400. (2007)
13. Michihiro Kuramochi and George Karypis. Finding Frequent Patterns in a Large Sparse Graph. Proc. of SIAM International Conference on Data Mining, (2004)
14. Siegfried Nijssen and Joost N. Kok. A Quickstart in Frequent Structure Mining can Make a Difference. Proc. of International Conference on Knowledge Discovery and Data Mining, pp. 647-652. (2004)
15. Jian Pei, Jiawei Han, Behzad Mortazavi-Asl, Helen Pinto, Qiming Chen, Umeshwar Dayal, and Meichun Hsu. PrefixSpan: Mining Sequential Patterns by Prefix-Projected Growth, Proc. of International Conference on Data Engineering, pp. 2-6. (2001)
16. Alberto Sanfeliu and King-Sun Fu. A Distance Measure Between Attributed Relational Graphs for Pattern Recognition, IEEE Transactions on Systems, Man and Cybernetic, Vol. 13, pp. 353-362. (1983)
17. Takashi Washio and Hiroshi Motoda. State of the Art of Graph-based Data Mining. SIGKDD Explorations, Vol. 5, Issue 1, pp. 59-68. (2003)
18. Xifeng Yan and Jiawei Han. gSpan: Graph-Based Substructure Pattern Mining. Proc. of IEEE International Conference on Data Mining, pp. 721-724. (2002)