Graph invariant kernels

IJCAI International Joint Conference on Artificial Intelligence

Volumn 2015-January, Issue , 2015, Pages 3756-3762

  Orsini, Francesco ^a,b   Frasconi, Paolo ^b   De Raedt, Luc ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b UNIVERSITY OF FLORENCE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

GRAPH INVARIANT; GRAPH KERNELS; HIGH-DIMENSIONAL; RELATIONAL DATA; STATE OF THE ART; SUBGRAPHS;

GRAPH THEORY;

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

References (28)

1. L. Babai, D. Yu. Grigoryev, and D. M. Mount. Isomorphism of graphs with bounded eigenvalue multiplicity. In Proc. of the Fourteenth Annual ACM Symposium on Theory of Computing, STOC '82, pages 310-324, New York, NY, USA, 1982. ACM.
2. K. M. Borgwardt and H-P Kriegel. Shortest-path kernels on graphs. In Data Mining, Fifth IEEE International Conference on, pages 8-pp. IEEE, 2005.
3. K. M. Borgwardt, C.S. Ong, S. Schönauer, S.V.N. Vishwanathan, A.J. Smola, and H.P. Kriegel. Protein function prediction via graph kernels. Bioinformatics, 21(suppl 1):i47-i56, 2005.
4. F. Costa and K. De Grave. Fast neighborhood subgraph pairwise distance kernel. In Proc. of the 26th ICML, pages 255-262, 2010.
5. D. Croce, A. Moschitti, and R. Basili. Structured lexical similarity via convolution kernels on dependency trees. In Proc. of the Conference on Empirical Methods in Natural Language Processing, pages 1034-1046. Association for Computational Linguistics, 2011.
6. M. C. De Marneffe, B. MacCartney, C. D. Manning, et al. Generating typed dependency parses from phrase structure parses. In Proc. of LREC, volume 6, pages 449-454, 2006.
7. M. Deshpande, M. Kuramochi, N. Wale, and G. Karypis. Frequent substructure-based approaches for classifying chemical compounds. IEEE Trans. on Knowledge and Data Engineering, 17(8):1036-1050, 2005.
8. P. D. Dobson and A. J. Doig. Distinguishing enzyme structures from non-enzymes without alignments. Journal of molecular biology, 330(4):771-783, 2003.
9. A. Feragen, N. Kasenburg, J. Petersen, M. de Bruijne, and K. Borgwardt. Scalable kernels for graphs with continuous attributes (see also erratum). In Advances in NIPS, pages 216-224, 2013.
10. D. Haussler. Convolution kernels on discrete structures. Technical report, Technical report, Department of Computer Science, University of California at Santa Cruz, 1999.
11. T. Horváth, T. Gärtner, and S. Wrobel. Cyclic pattern kernels for predictive graph mining. In Proc. of the tenth ACM SIGKDD international conference on KDDM, pages 158-167. ACM, 2004.
12. H. Kashima, K. Tsuda, and A. Inokuchi. Marginalized kernels between labeled graphs. In Proc. ICML, volume 3, pages 321-328, 2003.
13. J. Kazius, R. McGuire, and R. Bursi. Derivation and validation of toxicophores for mutagenicity prediction. Journal of Medicinal Chemistry, 48(1):312-320, 2005.
14. N. Kriege and P. Mutzel. Subgraph matching kernels for attributed graphs. In Proc. of the 29th ICML, 2012.
15. Xin Li and Dan Roth. Learning question classifiers. In Proc. of the 19th international conference on Computational linguistics-Volume 1, pages 1-7. Association for Computational Linguistics, 2002.
16. P. Mahé and J. Vert. Graph kernels based on tree patterns for molecules. Machine learning, 75(1):3-35, 2009.
17. B. D. McKay and A. Piperno. Practical graph isomorphism, II. Journal of Symbolic Computation, 60:94-112, 2014.
18. T. Mikolov, I. Sutskever, K. Chen, G. S. Corrado, and J. Dean. Distributed representations of words and phrases and their compositionality. In Advances in NIPS, pages 3111-3119, 2013.
19. M. Miller and J. Širán. Moore graphs and beyond: A survey of the degree/diameter problem. Electronic Journal of Combinatorics, 61:1-63, 2005.
20. M. Mladenov, B. Ahmadi, and K. Kersting. Lifted linear programming. In AISTATS, pages 788-797, 2012.
21. M. Neumann, N. Patricia, R. Garnett, and K. Kersting. Efficient graph kernels by randomization. In MLKDD, pages 378-393. Springer, 2012.
22. J. Ramon and T. Gärtner. Expressivity versus efficiency of graph kernels. In First International Workshop on Mining Graphs, Trees and Sequences, pages 65-74. Citeseer, 2003.
23. I. Schomburg, A. Chang, C. Ebeling, M. Gremse, C. Heldt, G. Huhn, and D. Schomburg. Brenda, the enzyme database: updates and major new developments. Nucleic acids research, 32(suppl 1):D431-D433, 2004.
24. R. K. Sevakula and N. K. Verma. Support vector machine for large databases as classifier. In Swarm, Evolutionary, and Memetic Computing, pages 303-313. Springer, 2012.
25. N. Shervashidze, P. Schweitzer, E. J. Van Leeuwen, K. Mehlhorn, and K. M. Borgwardt. Weisfeiler-lehman graph kernels. JMLR, 12:2539-2561, 2011.
26. S. Umeyama. An eigendecomposition approach to weighted graph matching problems. PAMI, IEEE Transactions on, 10(5):695-703, 1988.
27. M. Verbeke, P. Frasconi, V. Van Asch, R. Morante, W. Daelemans, and L. De Raedt. Kernelbased logical and relational learning with klog for hedge cue detection. In Inductive Logic Programming, pages 347-357. Springer, 2012.
28. B. Weisfeiler. On construction and identification of graphs. In Lecture Notes in Mathematics. Citeseer, 1976.