Subgraph matching kernels for attributed graphs

Proceedings of the 29th International Conference on Machine Learning, ICML 2012

Volumn 2, Issue , 2012, Pages 1015-1022

  Kriege, Nils ^a   Mutzel, Petra ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ATTRIBUTED GRAPHS; BIJECTIONS; CLASSIFICATION TASKS; GRAPH KERNELS; MATCHINGS; PRODUCT GRAPH; REAL-WORLD GRAPHS; SCORING SCHEMES; STRUCTURE-PRESERVING; SUBGRAPH MATCHING; SUBGRAPHS; TWO-GRAPHS;

GRAPH THEORY; LEARNING SYSTEMS;

GRAPHIC METHODS;

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

References (19)

1. Borgwardt, K.M. and Kriegel, H.-P. Shortest-path kernels on graphs. In Proc. ICDM, pp. 74-81, 2005.
2. Borgwardt, K.M., Ong, C.S., Schnauer, S., Vishwanathan, S.V.N., Smola, A.J., and Kriegel, H.-P. Protein function prediction via graph kernels. Bioinformatics, 21 Suppl 1:i47-i56, 2005.
3. Costa, F. and De Grave, K. Fast neighborhood subgraph pairwise distance kernel. In Proc. ICML, pp. 255-262, 2010.
4. Fröhlich, H., Wegner, J.K., Sieker, F., and Zell, A. Optimal assignment kernels for attributed molecular graphs. In Proc. ICML, pp. 225-232, 2005.
5. Gärtner, T., Flach, P., and Wrobel, S. On graph kernels: Hardness results and efficient alternatives, volume 2777 of LNCS, pp. 129-143. 2003.
6. Harchaoui, Z. and Bach, F. Image classification with segmentation graph kernels. In Proc. CVPR, 2007.
7. Haussler, D. Convolution kernels on discrete structures, 1999. Tech Rep UCSC-CRL-99-10.
8. Kashima, H., Tsuda, K., and Inokuchi, A. Marginalized kernels between labeled graphs. In Proc. ICML, pp. 321-328, 2003.
9. Koch, I. Enumerating all connected maximal common subgraphs in two graphs. Theor. Comput. Sci, 250 (1-2):1-30, 2001.
10. Levi, G. A note on the derivation of maximal common subgraphs of two directed or undirected graphs. Calcolo, 1973.
11. Mahé, P. and Vert, J.-P. Graph kernels based on tree patterns for molecules. Mach. Learn., 75:3-35, 2009.
12. Mahé, P., Ueda, N., Akutsu, T., Perret, J.-L., and Vert, J.-P. Extensions of marginalized graph kernels. In Proc. ICML, 2004.
13. Mahé, P., Ralaivola, L., Stoven, V., and Vert, J.-P. The pharmacophore kernel for virtual screening with support vector machines. J Chem Inf Model, 46(5): 2003-2014, 2006.
14. Menchetti, S., Costa, F., and Frasconi, P. Weighted decomposition kernels. In Proc. ICML, 2005.
15. Ramon, J. and Gärtner, T. Expressivity versus efficiency of graph kernels. In First International Work-shop on Mining Graphs, Trees and Sequences, 2003.
16. Shervashidze, N., Vishwanathan, S.V.N., Petri, T.H., Mehlhorn, K., and Borgwardt, K.M. Efficient graphlet kernels for large graph comparison. In AIS-TATS, 2009.
17. Shervashidze, N., Schweitzer, P., van Leeuwen, E.J., Mehlhorn, K., and Borgwardt, K.M. Weisfeilerlehman graph kernels. JMLR, 12:2539-2561, 2011.
18. Vishwanathan, S.V.N., Schraudolph, N.N., Kondor, R.I., and Borgwardt, K.M. Graph kernels. JMLR, 11:1201-1242, 2010.
19. Wale, N., Watson, I.A., and Karypis, G. Comparison of descriptor spaces for chemical compound retrieval and classification. Knowl Inf Sys, 14(3):347-375, 2008.