Extending local features with contextual information in graph kernels

Graph kernels are usually defined in terms of simpler kernels over local substructures of the original graphs. Different kernels consider different types of substructures. However, in some cases they have similar predictive performances, probably because the substructures can be interpreted as approximations of the subgraphs they induce. In this paper, we propose to associate to each feature a piece of information about the context in which the feature appears in the graph. A substructure appearing in two different graphs will match only if it appears with the same context in both graphs. We propose a kernel based on this idea that considers trees as substructures, and where the contexts are features too. The kernel is inspired from the framework in [7], even if it is not part of it. We give an efficient algorithm for computing the kernel and show promising results on real-world graph classification datasets.

[1]  S. V. N. Vishwanathan,et al.  Graph kernels , 2007 .

[2]  Alessandro Sperduti,et al.  Mining Structured Data , 2010, IEEE Computational Intelligence Magazine.

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

[4]  Kurt Mehlhorn,et al.  Weisfeiler-Lehman Graph Kernels , 2011, J. Mach. Learn. Res..

[5]  Charu C. Aggarwal,et al.  Managing and Mining Graph Data , 2010, Managing and Mining Graph Data.

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

[7]  Alessandro Sperduti,et al.  Exploiting the ODD framework to define a novel effective graph kernel , 2015, ESANN.

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

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

[10]  David Haussler,et al.  Convolution kernels on discrete structures , 1999 .

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

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

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