On graph kernels: Hardness results and efficient alternatives

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2777, Issue , 2003, Pages 129-143

  Gärtner, Thomas ^a,b,c   Flach, Peter ^c   Wrobel, Stefan ^a,b  

^a FRAUNHOFER IAIS   (Germany)

^b UNIVERSITY OF BONN   (Germany)

^c UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; GRAPH THEORY; LEARNING SYSTEMS; POLYNOMIALS; COMPUTATION THEORY; DIRECTED GRAPHS; GRAPHIC METHODS; POLYNOMIAL APPROXIMATION;

GRAPH ISOMORPHISM; GRAPH KERNELS; KERNEL FUNCTIONS; STRUCTURED DATA; GENERAL STRUCTURES; GRAPH ISOMORPHISM PROBLEM; HARDNESS RESULT; INNER PRODUCT; KERNEL METHODS; POLYNOMIAL-TIME; POSITIVE DEFINITE;

REAL TIME SYSTEMS; TREES (MATHEMATICS);

EID: 9444266406     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-45167-9_11     Document Type: Conference Paper

References (17)

1. B. E. Boser, I. M. Guyon, and V. N. Vapnik. A training algorithm for optimal margin classifiers. In D. Haussler, editor, Proceedings of the 5th Annual ACM Workshop on Computational Learning Theory, pages 144-152, Pittsburgh, PA, July 1992. ACM Press.
2. M. Collins and N. Duffy. Convolution kernels for natural language. In T. G. Dietterich, S. Becker, and Z. Ghahramani, editors, Advances in Neural Information Processing Systems, volume 14, Cambridge, MA, 2002. MIT Press.
3. R. Diestel. Graph Theory. Springer-Verlag, 2000.
4. T. Gärtner. Exponential and geometric kernels for graphs. In NIPS Workshop on Unreal Data: Principles of Modeling Nonvectorial Data, 2002.
5. T. Gärtner. Kernel-based multi-relational data mining. SIGKDD Explorations, 2003. to appear.
6. T. Gärtner, K. Driessens, and J. Ramon. Graph kernels and gaussian processes for relational reinforcement learning. In Proceedings of the 13th International Conference on Inductive Logic Programming, 2003. submitted.
7. R. Gray. Probability, Random Processes, and Ergodic Properties. Springer-Verlag, 1987.
8. W. Imrich and S. Klavžar. Product Graphs: Structure and Recognition. John Wiley, 2000.
9. H. Kashima and A. Inokuchi. Kernels for graph classification. In ICDM Workshop on Active Mining, 2002.
10. H. Kashima, K. Tsuda, and A. Inokuchi. Marginalized kernels between labeled graphs. In Proceedings of the 20th International Conference on Machine Learning, 2003. to appear.
11. J. Köbler, U. Schöning, and J. Toràn. The Graph Isomorphism Problem: Its Structural Complexity, Progress in Theoretical Computer Science. Birkhäuser, 1993.
12. R. I. Kondor and J. Lafferty. Diffusion kernels on graphs and other discrete input spaces. In C. Sammut and A. Hoffmann, editors, Proceedings of the 19th International Conference on Machine Learning, pages 315-322. Morgan Kaufmann, 2002.
13. B. Korte and J. Vygen. Combinatorial Optimization: Theory and Algorithms. Springer-Verlag, 2002.
14. H. Lodhi, C. Saunders, J. Shawe-Taylor, N. Cristianini, and C. Watkins. Text classification using string kernels. Journal of Machine Learning Research, 2:419-444, 2002.
15. B. Schölkopf and A. J. Smola. Learning with Kernels. The MIT Press, 2002.
16. S. Skiena. The Algorithm Design Manual. Springer-Verlag, 1997.
17. C. Watkins. Kernels from matching operations. Technical report, Department of Computer Science, Royal Holloway, University of London, 1999.