An efficient algorithm of frequent connected subgraph extraction

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2637, Issue , 2003, Pages 40-51

  Hong, Mingsheng ^a   Zhou, Haofeng ^a   Wang, Wei ^a   Shi, Baile ^a  

^a FUDAN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; DATA PROCESSING; GRAPH THEORY; MARKETING; PERFORMANCE; ALGORITHMS; TOPOLOGY;

DATA MINING RESEARCH; DATA SETS; SUBGRAPH EXTRACTION;

ALGORITHMS; DATA MINING;

CONNECTED SUBGRAPH; REAL-WORLD; SIMPLE TYPES; SYNTHETIC DATASETS;

EID: 7444259139     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-36175-8_5     Document Type: Conference Paper

References (25)

1. Agrawal, R., et al: Mining association rules between sets of items in large databases. In: Proc. of ACM SIGMOD (1993) 207-216
2. Agrawal, R., et al: Fast algorithms for mining association rules in large databases. In: Proc. of VLDB (1994) 487-499.
3. Park, J.S., et al: An Effective Hash Based Algorithm for Mining Association Rules. In: Proc. of ACM SIGMOD (1995) 175-186
4. Brin, S., et al: Dynamic itemset counting and implication rules for market basket data. In: Proc. of ACM SIGMOD (1997) 255-264
5. Han, J., et al: Mining frequent patterns without candidate generation. In: Proc. of ACM SIGMOD (2000) 1-12
6. Read, R. C., et al: The graph isomorphism disease. J. of Graph Theory, 4 (1977) 339-363
7. Babai, L., et al: Canonical labeling of graphs. In: Proc. of ACM STOC (1983) 171-183.
8. Inokuchi, A., et al: An apriori-based algorithm for mining frequent substructures from graph data. In: Proc. of PKDD, LNCS, Vol. 1910, Springer (2000) 13-23
9. Inokuchi, A., et al: Applying algebraic mining method of graph substructures to mutageniesis data analysis. In: KDD Challenge, PAKDD (2000) 41-46.
10. Inokuchi, A., et al: A fast algorithms for mining frequent connected subgraphs. Research Report RT0448, IBM Research, Tokyo Research Laboratory (2002)
11. Kuramochi, M., et al: Frequent subgraph discovery. In: Proc. of IEEE ICDM (2001) 313-320.
12. Kuramochi, M., et al: An efficient algorithm for discovering frequent subgraph. Technical Report 02-026, Dept. of Computer Science, University of Minnesota (2002)
13. Pei, J., et al: PrefixSpan: Mining sequential patterns by prefix-projected growth. In: Proc. of ICDE (2001) 215-224.
14. Cook, D. J., et al: Substructure discovery using minimum description length and background knowledge. J. of Artificial Intelligence Research 1 (1994) 231-255
15. Yoshida, K., et al: CLIP: Concept learning from inference patterns. Artificial Intelligence 1 (1995) 63-92
16. Motoda, H., et al: Machine learning techniques to make computers easier to use. In: Proc. of IJCAI, Vol. 2 (1997) 1622-1631
17. Matsuda, T., et al: Extension of graph-based induction for general graph structured data. In: Proc. of PAKDD, LNCS, Vol. 1805, Springer (2000) 420-431
18. Matsuda, T., et al: Knowledge discovery from structured data by beam-wise graph-based induction. In: Proc. of PRICAI, LNCS, Vol. 2417, Springer (2002) 255-264
19. Raedt, L. De, et al: The levelwise version space algorithm and its application to molecular fragment finding. In: Proc. of IJCAI Vol. 2 (2001) 853-862.
20. Dehaspe, L., et al: Finding frequent substructures in chemical compounds. In: Proc. of KDD (1998) 30-36
21. Kramer, S., et al: Molecular feature mining in HIV data. In: Proc. of ACM SIGKDD (2001) 136-143
22. Weininger D.: SMILES, a chemical language and information system. J. of Chemical Information and Computer Sciences 1 (1988) 31-36
23. James, C. A., et al: Daylight Theory Manual - Daylight 4.71
24. Wang, X., et al: Finding patterns in three dimensional graphs: Algorithms and applications to scientific data mining. IEEE TKDE 4 (2002) 731-749
25. Yan, X., et al: gSpan: Graph-based substructure pattern mining. In: Proc. of IEEE ICDM (2002)