Graph Kernels Exploiting Weisfeiler-Lehman Graph Isomorphism Test Extensions

In this paper we present a novel graph kernel framework inspired the by the Weisfeiler-Lehman (WL) isomorphism tests. Any WL test comprises a relabelling phase of the nodes based on test-specific information extracted from the graph, for example the set of neighbours of a node. We defined a novel relabelling and derived two kernels of the framework from it. The novel kernels are very fast to compute and achieve state-of-the-art results on five real-world datasets.

[1]  George Karypis,et al.  Comparison of descriptor spaces for chemical compound retrieval and classification , 2006, Sixth International Conference on Data Mining (ICDM'06).

[2]  Hans-Peter Kriegel,et al.  Shortest-path kernels on graphs , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).

[3]  Jean-Philippe Vert,et al.  Graph kernels based on tree patterns for molecules , 2006, Machine Learning.

[4]  Luc De Raedt,et al.  Data Mining and Machine Learning Techniques for the Identification of Mutagenicity Inducing Substructures and Structure Activity Relationships of Noncongeneric Compounds , 2004, J. Chem. Inf. Model..

[5]  M. Boyd,et al.  New soluble-formazan assay for HIV-1 cytopathic effects: application to high-flux screening of synthetic and natural products for AIDS-antiviral activity. , 1989, Journal of the National Cancer Institute.

[6]  Alessandro Sperduti,et al.  A Tree-Based Kernel for Graphs , 2012, SDM.

[7]  S. V. N. Vishwanathan,et al.  Fast Computation of Graph Kernels , 2006, NIPS.

[8]  Alessandro Sperduti,et al.  A memory efficient graph kernel , 2012, The 2012 International Joint Conference on Neural Networks (IJCNN).

[9]  Takunari Miyazaki,et al.  The complexity of McKay's canonical labeling algorithm , 1995, Groups and Computation.

[10]  P. Dobson,et al.  Distinguishing enzyme structures from non-enzymes without alignments. , 2003, Journal of molecular biology.

[11]  Neil Immerman,et al.  An optimal lower bound on the number of variables for graph identification , 1992, Comb..

[12]  Fabrizio Costa,et al.  Fast Neighborhood Subgraph Pairwise Distance Kernel , 2010, ICML.

[13]  Kurt Mehlhorn,et al.  Efficient graphlet kernels for large graph comparison , 2009, AISTATS.

[14]  Thomas Gärtner,et al.  On Graph Kernels: Hardness Results and Efficient Alternatives , 2003, COLT.

[15]  Juho Rousu,et al.  Efficient Path Kernels for Reaction Function Prediction , 2012, BIOINFORMATICS.

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

[17]  Fabíola Greve,et al.  A new refinement procedure for graph isomorphism algorithms , 2005, Electron. Notes Discret. Math..

[18]  B. Weisfeiler.  On construction and identification of graphs , 1976 .

[19]  Alexander J. Smola,et al.  Fast Kernels for String and Tree Matching , 2002, NIPS.

[20]  Karsten M. Borgwardt,et al.  Fast subtree kernels on graphs , 2009, NIPS.