Learning to classify structured data by graph propositionalization

Proceedings of the 2nd IASTED International Conference on Computational Intelligence, CI 2006

Volumn , Issue , 2006, Pages 393-398

  Karunaratne, Thashmee ^a   Boström, Henrik ^a  

^a STOCKHOLM UNIVERSITY   (Sweden)

Author keywords

Classification; Graph; Machine learning; Structured data

Indexed keywords

ARTIFICIAL INTELLIGENCE; EDUCATION; GRAPH THEORY; INTELLIGENT CONTROL; LEARNING SYSTEMS; PRINTING;

ART METHODS; BENCHMARK DATUMS; CLASSIFICATION; EXISTING METHODS; FINGER PRINTINGS; GRAPH; GRAPH BASED; INDUCED STRUCTURES; MACHINE LEARNING; PROPOSITIONALIZATION; STRUCTURED DATA; STRUCTURED DATUMS; SUB STRUCTURES;

COMPUTATIONAL GEOMETRY;

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

References (26)

1. M. J. Zaki, C. C. Aggarwal, XRules: an effective structural classifier for XML data, KDD, Washington, USA, 2003, ACM 316-325
2. J. R. Quinlan, R. M. Cameron-Jones, FOIL, Proceedings of the 6th European Conference on Machine Learning, Lecture Notes in Artificial Intelligence, Vol. 667, pp. 3-20. Springer-Verlag 1993
3. S. Muggleton, and C. Feng, Efficient induction in logic programs, Inductive Logic Programming, pages 281-298. Academic Press, 1992
4. A. Srinivasan, R. D. King, and S. Muggleton, "The role of background knowledge: using a problem from chemistry to examine the performance of an ILP program, Technical Report PRG-TR-08-99, Oxford University, 1999.
5. S. Muggleton, Inverse entailment and Progol, New Generation Computing, Special issue on Inductive Logic Programming, 13(3-4):245-286, 1995
6. D. J. Cook, and L. Holder, Substructure discovery using minimum description length and background knowledge, Journal of Artificial Intelligence Research, 1:231-255, 1994
7. T. Washio and H. Motoda, State of the Art of Graph-based Data Mining, SIGKDD Explorations Special Issue on Multi-Relational Data Mining, pp 59-68, Volume 5, Issue 1, 2003
8. L. Dehaspe, and H. Toivonen, Discovery of frequent datalog patterns, Data Mining and Knowledge Discovery, 3(1):7-36, 1999
9. J. Gonzalez, L. B. Holder, and D. J. Cook, Application of Graph-Based Concept Learning to the Predictive Toxicology Domain, Proceedings of the Predictive Toxicology Challenge Workshop, 2001
10. L. De Raedt, and S. Kramer, The levelwise version space algorithm and its application to molecular fragment finding, IJCAI'01: Seventeenth International Joint Conference on A. I., volume 2, pages 853-859, 2001
11. B. Bringmann, and A. Zimmermann, Tree - Decision Trees for Tree Structured Data, Proceedings of the 9th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD 2005), Notes in Artificial Intelligence, (LNAI) 3721, pp. 46-58, Springer 2005
12. T. Horváth, T. Gärtner, and S. Wrobel, Cyclic pattern kernels for predictive graph mining, Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining Pages: 158 - 167 Seattle, WA, USA, 2004
13. J. Ramon, and T. Gaertner, Expressivity versus efficiency of graph kernels, Proceedings of the First International Workshop on Mining Graphs, Trees and Sequences, pp. 65-74 ,2003
14. K. M. Borgwardt, and H. P. Kriegel, Shortest-Path Kernels on Graphs, ICDM 2005, pp: 74-81
15. C. Helma, S. Kramer, and L. De Raedt, The Molecular Feature Miner Molfea, "Molecular Informatics: Confronting Complexity", Proceedings of the Beilstein-Institut Workshop, Bozen, Italy, 2002
16. M-A. Krogel, S. Rawles, F. Železný, P. A. Flach, N. Lavrac̀, and S. Wrobel, Comparative evaluation of approaches to propositionalization, Proceedings of the 13th International Conference on Inductive Logic Programming (ILP'2003), number 2835 in Lecture Notes in Computer Science, pages 197-214, Springer Verlag 2003
17. N. Lavrac, and P. Flach, An extended transformation approach to Inductive Logic Programming, University publication, Department of Computer science, University of Bristol, 2000
18. N. Lavrac, F. Zelezny, and P. Flach, RSD: Relational Subgroup Discovery through First-order Feature Construction, Proceedings of the 12th International Conference on Inductive Logic Programming (ILP'02), Springer-Verlag, ISBN 3-540-00567-6, 2002
19. C. Nattee, S. Sinthupinyo, M. Numao, T. Okada, Inductive Logic Programming for Structure-Activity Relationship Studies on Large Scale Data, SAINT Workshops 2005: 332-335, 2005
20. A. Inokuchi, T. Washio, and H. Motoda, Complete mining of frequent patterns from graphs, Mining graph data, Machine Learning, 50:321-354, 2003
21. I. Fischer, and T. Meinl, Graph based molecular data mining - an overview, IEEE SMC 2004 Conference Proceedings, pages 4578-4582, 2004
22. A. K. Debnath, Lopez de Compadre, R.L., Debnath, G., Shusterman, A.J., and C. Hansch, Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds: Correlation with molecular orbital energies and hydrophobicity, Journal Med. Chem. 34:786-797
23. US National Toxicology program, http://ntp.niehs.nih.gov/index.cfm? objectid=32BA9724-F1F6-975E-7FCE50709CB4C932
24. D. Michie, S. Muggleton, D. Page, and A. Srinivasan,, To the international computing community: A new East-West challenge, Oxford University Computing laboratory, Oxford, UK, 1994, ftp://ftp.comlab.ox.ac. uk/pub/Packages/ILP/trains.tar.Z
25. L. Breiman, Random Forests, Machine Learning 45(1): 5-32, 2001
26. Ian H. Witten and Eibe Frank Data Mining: Practical machine learning tools and techniques, 2nd Edition, Morgan Kaufmann, San Francisco, USA, 2005