Scalable kernels for graphs with continuous attributes

While graphs with continuous node attributes arise in many applications, state-of-the-art graph kernels for comparing continuous-attributed graphs suffer from a high runtime complexity. For instance, the popular shortest path kernel scales as O(n4), where n is the number of nodes. In this paper, we present a class of graph kernels with computational complexity O(n2(m + log n + δ2 + d)), where δ is the graph diameter, m is the number of edges, and d is the dimension of the node attributes. Due to the sparsity and small diameter of real-world graphs, these kernels typically scale comfortably to large graphs. In our experiments, the presented kernels outperform state-of-the-art kernels in terms of speed and accuracy on classification benchmark datasets.

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

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

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

[4]  Mehryar Mohri,et al.  Rational Kernels: Theory and Algorithms , 2004, J. Mach. Learn. Res..

[5]  Benoit Gaüzère,et al.  Two new graphs kernels in chemoinformatics , 2012, Pattern Recognit. Lett..

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

[7]  Hisashi Kashima,et al.  Fast Computation of Subpath Kernel for Trees , 2012, ICML.

[8]  Roman Garnett,et al.  Efficient Graph Kernels by Randomization , 2012, ECML/PKDD.

[9]  Chih-Jen Lin,et al.  LIBSVM: A library for support vector machines , 2011, TIST.

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

[11]  Marleen de Bruijne,et al.  Geometric Tree Kernels: Classification of COPD from Airway Tree Geometry , 2013, IPMI.

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

[13]  Marleen de Bruijne,et al.  Optimal Graph Based Segmentation Using Flow Lines with Application to Airway Wall Segmentation , 2011, IPMI.

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

[15]  Francis R. Bach,et al.  Graph kernels between point clouds , 2007, ICML '08.

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

[17]  Antje Chang,et al.  BRENDA , the enzyme database : updates and major new developments , 2003 .

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

[19]  Nils M. Kriege,et al.  Subgraph Matching Kernels for Attributed Graphs , 2012, ICML.

[20]  A. Dirksen,et al.  The Danish Randomized Lung Cancer CT Screening Trial—Overall Design and Results of the Prevalence Round , 2009, Journal of thoracic oncology : official publication of the International Association for the Study of Lung Cancer.

[21]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

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

[23]  Tatsuya Akutsu,et al.  Extensions of marginalized graph kernels , 2004, ICML.

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

[25]  Ronald L. Rivest,et al.  Introduction to Algorithms, third edition , 2009 .

[26]  Hans-Peter Kriegel,et al.  Protein function prediction via graph kernels , 2005, ISMB.

[27]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .