论文信息 - On Graph Kernels: Hardness Results and Efficient Alternatives

On Graph Kernels: Hardness Results and Efficient Alternatives

As most ‘real-world’ data is structured, research in kernel methods has begun investigating kernels for various kinds of structured data. One of the most widely used tools for modeling structured data are graphs. An interesting and important challenge is thus to investigate kernels on instances that are represented by graphs. So far, only very specific graphs such as trees and strings have been considered.

Thomas Gärtner | Peter A. Flach | Stefan Wrobel | S. Wrobel | Thomas Gärtner

[1] J. Köbler,et al. The Graph Isomorphism Problem: Its Structural Complexity , 1993 .

[2] Reinhard Diestel,et al. Graph Theory , 1997 .

[3] Nello Cristianini,et al. Classification using String Kernels , 2000 .

[4] Steven Skiena,et al. The Algorithm Design Manual , 2020, Texts in Computer Science.

[5] John D. Lafferty,et al. Diffusion Kernels on Graphs and Other Discrete Input Spaces , 2002, ICML.

[6] Michael Collins,et al. Convolution Kernels for Natural Language , 2001, NIPS.

[7] Bernhard E. Boser,et al. A training algorithm for optimal margin classifiers , 1992, COLT '92.

[8] Jacobo Torán,et al. The graph isomorphism problem , 2020, Commun. ACM.

[9] Alexander J. Smola,et al. Learning with kernels , 1998 .

[10] W. Imrich,et al. Product Graphs: Structure and Recognition , 2000 .

[11] Hisashi Kashima,et al. Marginalized Kernels Between Labeled Graphs , 2003, ICML.

[12] Robert M. Gray,et al. Probability, Random Processes, And Ergodic Properties , 1987 .

[13] Hisashi Kashima,et al. Kernels for graph classification , 2002 .

[14] Saso Dzeroski,et al. Multi-relational data mining: an introduction , 2003, SKDD.