Mining patterns from structured data by beam-wise graph-based induction

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

Volumn 2534, Issue , 2002, Pages 422-429

  Matsuda, Takashi ^a   Motoda, Hiroshi ^a   Yoshida, Tetsuya ^a   Washio, Takashi ^a  

^a OSAKA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; LEARNING SYSTEMS;

EVALUATION FUNCTION; GRAPH-BASED INDUCTION; MACHINE LEARNING TECHNIQUES; SEARCH CAPABILITIES; STEPWISE PAIR EXPANSION; STRUCTURED DATA; TYPICAL PATTERNS; UCI REPOSITORY;

GRAPHIC METHODS;

EID: 84949762623     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36182-0_44     Document Type: Conference Paper

References (18)

1. C. L. Blake, E. Keogh, and C.J. Merz. Uci repository of machine leaning database, 1998. http://www.ics.uci.edu/∼mlearn/MLRepository.html.
2. L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone. Classification and Regression Trees. Wadsworth & Brooks/Cole Advanced Books & Software, 1984.
3. L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone. The cn2 induction algorithm. Machine Learning, 3:261–283, 1989.
4. D. J. Cook and L. B. Holder. Graph-based data mining. IEEE Intelligent Systems, 15(2):32–41, 2000.
5. L. De Raedt and S. Kramer. The levelwise version space algorithm and its application to molecular fragment finding. In Proc. the 17th International Joint Conference on Artificial Intelligence, pages 853–859, 2001.
6. L. Dehaspe, H. Toivonen, and R. D. King. Finding frequent substructures in chemical compound. In Proc. the 4th International conference on Knowledge Discovery and Data Mining, pages 30–36, 1998.
7. S. Fortin. The graph isomorphism problem, 1996.
8. A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In Proc. of the 4th European Conference on Principles of Data Mining and Knowledge Discovery, pages 13–23, 2000.
9. S. Kramer, L. De Raedt, and C. Helma. Molecular feature miing in hiv data. In Proc. the 7th ACM SIGKDD International conference on Knowledge Discovery and Data Mining, pages 136–143, 2001.
10. T. Matsuda, T. Horiuchi, H. Motoda, and T. Washio. Extension of graph-based induction for general graph structured data. In Knowledge Discovery and Data Mining: Current Issues and New Applications, Springer Verlag, LNAI 1805, pages 420–431, 2000.
11. T. Matsuda, H. Motoda, and T. Washio. Graph-based induction and its applications. Advanced Engineering Informatics, 16(2):135–143, 2002.
12. R. S. Michalski. Learning flexible concepts: Fundamental ideas and a method based on two-tiered representaion. In Machine Learning, An Artificial Intelligence Approiach, 3:63–102, 1990.
13. S. Muggleton and L. de Raedt. Inductive logic programming: Theory and methods. Journal of Logic Programming, 19(20):629–679, 1994.
14. J. R. Quinlan. Induction of decision trees. Machine Learning, 1:81–106, 1986.
15. J. R. Quinlan. C4.5:Programs For Machine Learning. Morgan Kaufmann Publishers, 1993.
16. R. C. Read and D. G. Corneil. The graph isomorphism disease. Journal of Graph Theory, 1:339–363, 1977.
17. G. G. Towell and J. W. Shavlik. Extracting refined rules from knowledge-based neural networks. Machine Learning, 13:71–101, 1993.
18. K. Yoshida and H. Motoda. Clip: Concept learning from inference pattern. Journal of Artificial Intelligence, 75(1):63–92, 1995.