gSpan: Graph-based substructure pattern mining

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2002, Pages 721-724

  Yan, Xifeng ^a   Han, Jiawei ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 78149333073     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In VLDB'94, pages 487-499, Sept. 1994.
2. T. Asai, K. Abe, S. Kawasoe, H. Arimura, H. Satamoto, and S. Arikawa. Efficient substructure discovery from large semi-structured data. In SIAM SDM'02, April 2002.
3. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2001, Second Edition.
4. A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In PKDD'00. pages 13-23, 2000.
5. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In ICDM'01, pages 313-320, Nov. 2001.
6. J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, and M.-C. Hsu. PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth. In ICDE'01, pages 215-224, April 2001.
7. X. Yan and J. Han. gspan: Graph-based substructure pattern mining. Technical Report UIUCDCS-R-2002-2296, Department of Computer Science, University of Illinois at Urbana-Champaign, 2002.
8. M. J. Zaki. Efficiently mining frequent trees in a forest. In KDD'02, July 2002.