A method for classifying vertices of labeled graphs applied to knowledge discovery from molecules

Frontiers in Artificial Intelligence and Applications

Volumn 178, Issue , 2008, Pages 147-151

  Pennerath, Frédéric ^a,b   Polaillon, Géraldine ^a   Napoli, Amedeo ^b  

^a SUPELEC   (France)

^b Nancy Hospital   (France)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; LEARNING SYSTEMS;

CONFIDENCE INDICES; GENERIC METHOD; LABELED GRAPHS; LEARNING METHODS; TARGET CLASS;

MOLECULES;

EID: 77649211266     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-58603-891-5-147     Document Type: Conference Paper

References (16)

1. Graph Labelling Workshop of ECML/PKDD 2007, the 11th European Conference on Principles and Practice of Knowledge Discovery in Databases, Warsaw, Poland, 2007.
2. D. J. Cook and L. B. Holder, ‘Substructure discovery using minimum description length and background knowledge’, Journal of Artificial Intelligence Research, 1, 231–255, (1994).
3. E.J. Corey and X.M. Cheng, The Logic of Chemical Synthesis, John Wiley & Sons, New York, 1989.
4. M. Deshpande, M. Kuramochi, and G. Karypis, ‘Frequent sub-structure-based approaches for classifying chemical compounds’, icdm, 00, 35, (2003).
5. T. Gärtner, T. Horvarth, Q. V. Le, A. J. Smola, and S. Wrobel, Mining Graph Data, chapter 11, Wiley-Interscience, 2006.
6. J. Gasteiger, M. Pförtner, M. Sitzmann, R. Höllering, O. Sacher, T. Kostka, and N. Karg, ‘Computer-assisted synthesis and reaction planning in combinatorial chemistry’, Perspectives in Drug Discovery and Design, 20, 245–264, (2000).
7. A. Inokuchi, T. Washio, and H. Motoda, ‘An apriori-based algorithm for mining frequent substructures from graph data’, in PKDD’00: Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery, pp. 13–23, London, UK, (2000). Springer-Verlag.
8. M. Kuramochi and G. Karypis, ‘Frequent subgraph discovery’, in ICDM’01: Proceedings of the 2001 IEEE International Conference on Data Mining, pp. 313–320, (2001).
9. S. Nijssen and J. N. Kok, ‘A quickstart in frequent structure mining can make a difference’, in KDD’04: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 647–652, New York, NY, USA, (2004). ACM Press.
10. Luc De Raedt, Thomas G. Dietterich, Lise Getoor, Kristian Kersting, and Stephen Muggleton, eds. Probabilistic, Logical and Relational Learning - A Further Synthesis, 15.04. - 20.04.2007, volume 07161 of Dagstuhl Seminar Proceedings. Internationales Begegnungs- und Forschungszentrum fuer In-formatik (IBFI), Schloss Dagstuhl, Germany, 2008.
11. J.-C. Régin. Développement d’outils algorithmiques pour l’intelligence artificielle. Application à la chimie organique. Thèse de l’Université des Sciences et Techniques du Langue-doc, Montpellier, 1995.
12. J.C. Regin, O. Gascuel, and C. Laurenco, ‘Machine learning of strategic knowledge in organic synthesis from reaction databases’, in Proceedings of E.C.C.C-1, Computational Chemistry, eds., F. Bernardi and J.L. Rivail, pp. 618–623, Woodbury, NY, (1995). AIP Press.
13. H. Satoh and T. Nakata, ‘Knowledge discovery on chemical reactivity from experimental reaction information’, in Discovery Science, eds., Gunter Grieser, Yuzuru Tanaka, and Aki-hiro Yamamoto, volume 2843 of Lecture Notes in Computer Science, pp. 470–477. Springer, (2003).
14. R. M. H. Ting and J. Bailey, ‘Mining minimal contrast subgraph patterns’, in SDM, eds., J. Ghosh, D. Lambert, D. B. Skillicorn, and J. Srivastava. SIAM, (2006).
15. X. Yan and J. Han, ‘gspan: Graph-based substructure pattern mining’, in ICDM’02: Proceedings of the 2002 IEEE International Conference on Data Mining, p. 721, Washington, DC, USA, (2002). IEEE Computer Society.
16. Dengyong Zhou, Jiayuan Huang, and Bernhard Schölkopf, ‘Learning from labeled and unlabeled data on a directed graph’, in ICML, eds., Luc De Raedt and Stefan Wrobel, volume 119 of ACM International Conference Proceeding Series, pp. 1036–1043. ACM, (2005).