Novel kernels for error-tolerant graph classification.

One of the major difficulties in graph classification is the lack of mathematical structure in the space of graphs. The use of kernel machines allows us to overcome this fundamental limitation in an elegant manner by addressing the pattern recognition problem in an implicitly existing feature vector space instead of the original space of graphs. In this paper we propose three novel error-tolerant graph kernels -- a diffusion kernel, a convolution kernel, and a random walk kernel. The kernels are closely related to one of the most flexible graph matching methods, graph edit distance. Consequently, our kernels are applicable to virtually any kind of graph. They also show a high degree of robustness against various types of distortion. In an experimental evaluation involving the classification of line drawings, images, diatoms, fingerprints, and molecules, we demonstrate the superior performance of the proposed kernels in conjunction with support vector machines over a standard nearest-neighbor reference method and several other graph kernels including a standard random walk kernel.

[1]  Kaspar Riesen,et al.  Approximate graph edit distance computation by means of bipartite graph matching , 2009, Image Vis. Comput..

[2]  Thomas Gärtner,et al.  Kernels for structured data , 2008, Series in Machine Perception and Artificial Intelligence.

[3]  Horst Bunke,et al.  Bridging the Gap between Graph Edit Distance and Kernel Machines , 2007, Series in Machine Perception and Artificial Intelligence.

[4]  Horst Bunke,et al.  Edit distance-based kernel functions for structural pattern classification , 2006, Pattern Recognit..

[5]  Horst Bunke,et al.  A Graph Matching Based Approach to Fingerprint Classification Using Directional Variance , 2005, AVBPA.

[6]  Marco Gori,et al.  Exact and approximate graph matching using random walks , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Horst Bunke,et al.  Feature Selection for Graph-Based Image Classifiers , 2005, IbPRIA.

[8]  Bernard Haasdonk,et al.  Feature space interpretation of SVMs with indefinite kernels , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  Anil K. Jain,et al.  Handbook of Fingerprint Recognition , 2005, Springer Professional Computing.

[10]  Fritz Wysotzki,et al.  SVM learning with the Schur-Hadamard inner product for graphs , 2005, Neurocomputing.

[11]  Antonio Robles-Kelly,et al.  Graph edit distance from spectral seriation , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  Terry Caelli,et al.  Inexact Graph Matching Using Eigen-Subspace Projection Clustering , 2004, Int. J. Pattern Recognit. Artif. Intell..

[13]  Mario Vento,et al.  Thirty Years Of Graph Matching In Pattern Recognition , 2004, Int. J. Pattern Recognit. Artif. Intell..

[14]  Adnan Amin,et al.  Fingerprint classification: a review , 2004, Pattern Analysis and Applications.

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

[16]  Horst Bunke,et al.  Graph Edit Distance with Node Splitting and Merging, and Its Application to Diatom Idenfication , 2003, GbRPR.

[17]  Edwin R. Hancock,et al.  Computing approximate tree edit distance using relaxation labeling , 2003, Pattern Recognit. Lett..

[18]  Alessandro Sperduti,et al.  A general framework for adaptive processing of data structures , 1998, IEEE Trans. Neural Networks.

[19]  Edwin R. Hancock,et al.  Structural Matching by Discrete Relaxation , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[20]  Edwin R. Hancock,et al.  Inexact graph matching using genetic search , 1997, Pattern Recognit..

[21]  Shinji Umeyama,et al.  An Eigendecomposition Approach to Weighted Graph Matching Problems , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[22]  King-Sun Fu,et al.  A distance measure between attributed relational graphs for pattern recognition , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[23]  Horst Bunke,et al.  Inexact graph matching for structural pattern recognition , 1983, Pattern Recognit. Lett..

[24]  Stanley M. Selkow,et al.  The Tree-to-Tree Editing Problem , 1977, Inf. Process. Lett..

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

[26]  N. Cristianini,et al.  Kernel Methods for Pattern Analysis , 2003, ICTAI.

[27]  H. Bunke,et al.  Graph matching for visual object recognition. , 2000, Spatial vision.

[28]  C. Berg,et al.  Harmonic Analysis on Semigroups , 1984 .

[29]  Michael J. Fischer,et al.  The String-to-String Correction Problem , 1974, JACM.