A tree-based kernel for graphs

Proceedings of the 12th SIAM International Conference on Data Mining, SDM 2012

Volumn , Issue , 2012, Pages 975-986

  Da San Martino, Giovanni ^a   Navarin, Nicolò ^a   Sperduti, Alessandro ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; DIRECTED GRAPHS; GRAPHIC METHODS;

BENCHMARK DATASETS; DIRECTED ACYCLIC GRAPHS; MULTI-SETS; STATE OF THE ART; THEORETICAL BOUNDS; TREE KERNELS; TREE-BASED;

TREES (MATHEMATICS);

EID: 84880225375     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972825.84     Document Type: Conference Paper

References (23)

1. F. Aiolli, G. Da San Martino, A. Sperduti, and A. Moschitti, Fast on-line kernel learning for trees, in Proceedings of the 2006 IEEE Conference on Data Mining, Los Alamitos, CA, USA, 18-22 December 2006, IEEE Computer Society, pp. 787-791.
2. K. M. Borgwardt and H.-P. Kriegel, Shortest- path kernels on graphs, in Proceedings of the Fifth IEEE International Conference on Data Mining, IEEE Computer Society, 2005, pp. 74-81.
3. B. Bringmann, A. Zimmermann, L. D. Raedt, and S. Nijssen, Don't be afraid of simpler patterns, in PKDD, J. Fürnkranz, T. Scheér, and M. Spiliopoulou, eds., vol. 4213 of Lecture Notes in Computer Science, Springer, 2006, pp. 55-66.
4. M. Collins and N. Duffy, New ranking algorithms for parsing and tagging: kernels over discrete struc- Tures, and the voted perceptron, in Proceedings of the 40th Annual Meeting on Association for Computational Linguistics, Philadelphia, Pennsylvania, 2002, Association for Computational Linguistics, pp. 263-270.
5. F. Costa and K. De Grave, Fast neighborhood subgraph pairwise distance kernel, in Proceedings of the 26th International Conference on Machine Learning, 2010.
6. A. K. Debnath, R. L. Lopez de Compadre, G. Debnath, A. J. Shusterman, and C. Hansch, Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds. correlation with molecular orbital energies and hydrophobicity, Journal of Medicinal Chemistry, 34 (1991), pp. 786-797.
7. O. Flint, Private communications, 2010.
8. T. Gärtner, P. Flach, and S. Wrobel, On graph kernels: Hardness results and eficient alternatives, Lecture notes in computer science, (2003), pp. 129-143.
9. D. Haussler, Convolution kernels on discrete struc- Tures, tech. rep., Department of Computer Science, University of California at Santa Cruz, 1999.
10. C. Helma, T. Cramer, S. Kramer, and L. D. Raedt, Data mining and machine learning techniques for the identification of mutagenicity inducing sub- structures and structure activity relationships of non- congeneric compounds, Journal of Chemical Information and Computer Sciences, 44 (2004), pp. 1402-1411.
11. H. Kashima, Machine Learning Approaches for Struc- Tured Data, PhD thesis, Graduate School of Informatics, Kyoto University, Japan, 2007.
12. H. Kashima, K. Tsuda, and A. Inokuchi, Marginalized kernels between labeled graphs., in ICML, T. Fawcett and N. Mishra, eds., AAAI Press, 2003, pp. 321-328.
13. J. Kazius, S. Nijssen, J. Kok, T. Back, and A. P. Ijzerman, Substructure mining using elaborate chemical representation, J. Chem. Inf. Model., 46 (2006), pp. 597-605.
14. D. Kimura, T. Kuboyama, T. Shibuya, and H. Kashima, A subpath kernel for rooted unordered trees, in In Proceedings of the 15th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), Shenzeng, China, 2011.
15. P. Mahé and J. Vert, Graph kernels based on tree patterns for molecules, Machine Learning, 75 (2009), pp. 3-35.
16. A. Moschitti, Eficient convolution kernels for de- pendency and constituent syntactic trees, in ECML, J. Fürnkranz, T. Sche-er, and M. Spiliopoulou, eds., vol. 4212 of Lecture Notes in Computer Science, Machine Learning: ECML 2006, 17th European Conference on Machine Learning, Proceedings, Berlin, Germany, September 2006, pp. 318-329.
17. R. C. Read and D. G. Corneil, The graph iso- morphism disease, Journal of Graph Theory, 1 (1977), pp. 339-363.
18. H. Saigo, S. Nowozin, T. Kadowaki, T. Kudo, and K. Tsuda, gboost: A mathematical programming approach to graph classification and regression., Machine Learning, (2009), pp. 69-89.
19. L. Schietgat, F. Costa, J. Ramon, and L. De Raedt, Maximum common subgraph mining: A fast and effective approach towards feature generation, in 7th InternationalWorkshop on Mining and Learning with Graphs, 2009, pp. 1-3.
20. N. Shervashidze and K. M. Borgwardt, Fast sub- Tree kernels on graphs, in NIPS, Y. Bengio, D. Schuurmans, J. D. Laérty, C. K. I. Williams, and A. Culotta, eds., Curran Associates, Inc., 2009, pp. 1660-1668.
21. S. V. N. Vishwanathan and A. J. Smola, Fast kernels for string and tree matching, in Advances in Neural Information Processing Systems 15, MIT Press, 2003, pp. 569-576.
22. N. Wale, I. Watson, and G. Karypis, Compar- ison of descriptor spaces for chemical compound re- Trieval and classification, Knowledge and Information Systems, 14 (2008), pp. 347-375. 10.1007/s10115-007- 0103-5.
23. O. S. Weislow, R. Kiser, D. L. Fine, J. Bader, R. H. Shoemaker, and M. R. Boyd, New soluble- formazan assay for hiv-1 cytopathic effects: Application to high-ux screening of synthetic and natural products for aids-antiviral activity., Journal of the National Cancer Institute, 81 (1989), pp. 577-86.