Cl-GBI: A novel approach for extracting typical patterns from graph-structured data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3518 LNAI, Issue , 2005, Pages 639-649

  Nguyen, Phu Chien ^a   Ohara, Kouzou ^a   Motoda, Hiroshi ^a   Washio, Takashi ^a  

^a OSAKA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CURRICULA; DATA MINING; EDUCATION; FEATURE EXTRACTION; INFORMATION TECHNOLOGY; LEARNING SYSTEMS; TEACHING;

GRAPH-BASED INDUCTION (GBI); GRAPH-STRUCTURED DATA; PAIR-WISE CHUNKING;

GRAPH THEORY;

EID: 26944438666     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11430919_74     Document Type: Conference Paper

References (16)

1. Blake, C.L., Keogh, E., and Merz, C.J. 1998. UCI Repository of Machine Learning Database, http://www.ics.uci.edu/~mlearn/MLRepository.html.
2. Borgelt, C. and Berthold, M.R. 2002. Mining Molecular Fragments: Finding Relevant Substructures of Molecules. In: Proc. ICDM 2002, pp.51-58.
3. Breiman, L., Friedman, J.H., Olshen, R.A., and Stone, C.J. 1984. Classification and Regression Trees, Wadsworth & Brooks/Cole Advanced Books & Software.
4. Cook, D. J. and Holder, L. B. 1994. Substructure Discovery Using Minimum Description Length and Background Knowledge, Artificial Intelligence Research, Vol. 1, pp. 231-255.
5. Fortin, S. 1996. The Graph Isomorphism Problem, Technical Report TR96-20, Department of Computer Science, University of Alberta, Edmonton, Canada.
6. Gaemsakul, W., Matsuda, T., Yoshida, T., Motoda, M., and Washio, T. 2003. Classifier Construction by Graph-Based Induction for Graph-Structured Data, In: Proc. PAKDD 2003, pp. 52-62.
7. Huan, J., Wang, W., and Prins, J., 2003. Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism, In: Proc. ICDM 2003, pp. 549-552.
8. Inokuchi, A., Washio, T., and Motoda, H. 2003. Complete Mining of Frequent Patterns from Graphs: Mining Graph Data, Machine Learning, Vol. 50, No. 3, pp. 321-354.
9. Inokuchi, A., Washio, T., Nishimura, K., and Motoda, H. 2002. A Fast Algorithm for Mining Frequent Connected Subgraphs, IBM Research Report RT0448, Tokyo Research Laboratory, IBM Japan.
10. Kuramochi, M. and Karypis, G. 2004. An Efficient Algorithm for Discovering Frequent Subgraphs, IEEE Trans. Knowledge and Data Engineering, Vol. 16, No. 9, pp. 1038-1051.
11. Kuramochi, M. and Karypis, G. 2004. GREW-A Scalable Frequent Subgraph Discovery Algorithm, In: Proc. ICDM 2004, pp. 439-442.
12. Matsuda, T., Motoda, H., Yoshida, T., and Washio, T. 2002. Mining Patterns from Structured Data by Beam-wise Graph-Based Induction, In: Proc. DS 2002, pp. 422-429.
13. Quinlan, J.R. 1986. Induction of Decision Trees, Machine Learning, Vol. 1, pp. 81-106.
14. Quinlan, J.R. 1993. C4.5: Programs for Machine Learning, Morgan Kaufmann Publishers.
15. Yan, X. and Han, J. 2002. gSpan: Graph-Based Structure Pattern Mining, In: Proc. ICDM 2002, pp. 721-724.
16. Yoshida, K. and Motoda, M. 1995. CLIP: Concept Learning from Inference Patterns, Artificial Intelligence, Vol. 75, No. 1, pp. 63-92.