A fast method to mine frequent subsequences from graph sequence data

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2008, Pages 303-312

  Inokuchi, Akihiro ^a,b   Washio, Takashi ^a  

^a OSAKA UNIVERSITY   (Japan)

^b JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL DATASETS; FAST METHODS; FREQUENT SUBGRAPHS; GRAPH SEQUENCES; GRAPH TRANSFORMATION; LABELED GRAPHS; REAL-WORLD DATASETS;

MINING;

INFORMATION MANAGEMENT;

EID: 67049138463     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2008.106     Document Type: Conference Paper

References (19)

1. R. Agrawal and R. Srikant. Mining Sequential Patterns. Proc. of Int'l Conf. on Data Engineering, pp. 3-14, (1995)
2. A. L. Barabási and R. Albert. Emergence of scaling in random networks. Science, 286, pp. 509-512, (1999)
3. K M. Borgwardt, et. al. Pattern Mining in Frequent Dynamic Subgraphs. Proc. of Int'l Conf. on Data Mining, pp. 818-822. (2006)
4. Enron Email Dataset, http://www.cs.cmu.edu/~enron/
5. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman. (1979)
6. T.B. Ho, et al. Exploiting Temporal Relations in Mining Hepatitis Data, New Generation Computing, Vol.25, No. 3, pp.247-262. (2007)
7. A. Inokuchi, et. al. An Apriori-based Algorithm for Mining Frequent Substructures from Graph Data. Proc. of European Conf. on Principles of Data Mining and Knowledge Discovery, pp. 13-23. (2000)
8. A. Inokuchi, et. al. A Fast Algorithm for Mining Frequent Connected Subgraphs. IBM Research Report, RT0448. (2002)
9. J.P. Kukluk, et. al. Inference of Node Replacement Graph Grammars. Intelligent Data Analysis, Vol.11, No. 4, pp. 377-400. (2007)
10. E. Jeltsch and H. Kreowski. Grammatical Inference Based on Hyperedge Replacement. Graph-Grammars. Lecture Notes in Computer Science 532, pp. 461-474. (1990)
11. I. Jonyer, et. al. MDL-based Context-free Graph Grammar Induction and Applications. International Journal on Artificial Intelligence Tools, Vol.13, No. 1, pp. 65-79. (2004)
12. H. Mannila, et. al. Discovering Frequent Episodes in Sequences. Proc. of Int'l Conf. on Knowledge Discovery and Data Mining, pp. 210-215. (1995)
13. MIT Media Lab: Reality Mining, http://reality.media.mit.edu/
14. S. Nijssen and J.N. Kok. A Quickstart in Frequent Structure Mining can Make a Difference. Proc. of Int'l Conf. on Knowledge Discovery and Data Mining, pp. 647-652. (2004) (Pubitemid 40114985)
15. J. Pei, et. al. PrefixSpan: Mining Sequential Patterns by Prefix- Projected Growth, Proc. of Int'l Conf. on Data Eng., pp. 2-6. (2001)
16. A. Sanfeliu and K.S. Fu. A Distance Measure Between Attributed Relational Graphs for Pattern Recognition, IEEE Transactions on Systems, Man and Cybernetic, Vol.13, pp. 353-362. (1983) (Pubitemid 13591176)
17. Y. Venema. Temporal Logic, Goble, Lou, ed., The Blackwell Guide to Philosophical Logic. Blackwell (2001)
18. T.Washio and H.Motoda. State of the Art of Graph-based Data Mining. SIGKDD Explorations, Vol.5, Issue 1, pp. 59-68. (2003)
19. X. Yan and J. Han. gSpan: Graph-Based Substructure Pattern Mining. Proc. of Int'l Conf. on Data Mining, pp. 721-724. (2002)