Marginalized Kernels Between Labeled Graphs

A new kernel function between two labeled graphs is presented. Feature vectors are defined as the counts of label paths produced by random walks on graphs. The kernel computation finally boils down to obtaining the stationary state of a discrete-time linear system, thus is efficiently performed by solving simultaneous linear equations. Our kernel is based on an infinite dimensional feature space, so it is fundamentally different from other string or tree kernels based on dynamic programming. We will present promising empirical results in classification of chemical compounds.

[1]  Richard Barrett,et al.  Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods , 1994, Other Titles in Applied Mathematics.

[2]  Ashwin Srinivasan,et al.  Theories for Mutagenicity: A Study in First-Order and Feature-Based Induction , 1996, Artif. Intell..

[3]  Yoav Freund,et al.  Large Margin Classification Using the Perceptron Algorithm , 1998, COLT' 98.

[4]  Vladimir Vapnik,et al.  Statistical learning theory , 1998 .

[5]  Sean R. Eddy,et al.  Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids , 1998 .

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

[7]  Dan Suciu,et al.  Data on the Web: From Relations to Semistructured Data and XML , 1999 .

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

[9]  C. Watkins.  Dynamic Alignment Kernels , 1999 .

[10]  David Haussler,et al.  A Discriminative Framework for Detecting Remote Protein Homologies , 2000, J. Comput. Biol..

[11]  Takashi Washio,et al.  An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data , 2000, PKDD.

[12]  Bernhard Schölkopf,et al.  Dynamic Alignment Kernels , 2000 .

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

[14]  Luc De Raedt,et al.  The Levelwise Version Space Algorithm and its Application to Molecular Fragment Finding , 2001, IJCAI.

[15]  Bernhard Schölkopf,et al.  Learning with kernels , 2001 .

[16]  Luc De Raedt,et al.  Feature Construction with Version Spaces for Biochemical Applications , 2001, ICML.

[17]  Ashwin Srinivasan,et al.  The Predictive Toxicology Challenge 2000-2001 , 2001, Bioinform..

[18]  Shigeki Sagayama,et al.  Dynamic Time-Alignment Kernel in Support Vector Machine , 2001, NIPS.

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

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

[21]  Mehryar Mohri,et al.  Rational Kernels , 2002, NIPS.

[22]  Hinrich Schütze,et al.  Book Reviews: Foundations of Statistical Natural Language Processing , 1999, CL.

[23]  Jason Weston,et al.  Mismatch String Kernels for SVM Protein Classification , 2002, NIPS.

[24]  Hisashi Kashima,et al.  Kernels for Semi-Structured Data , 2002, ICML.

[25]  Claus Bahlmann,et al.  Online handwriting recognition with support vector machines - a kernel approach , 2002, Proceedings Eighth International Workshop on Frontiers in Handwriting Recognition.

[26]  Nello Cristianini,et al.  Learning Semantic Similarity , 2002, NIPS.

[27]  Kiyoshi Asai,et al.  Marginalized kernels for biological sequences , 2002, ISMB.

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

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

[30]  Roy M. Howard,et al.  Linear System Theory , 1992 .

[31]  John D. Lafferty,et al.  Information Diffusion Kernels , 2002, NIPS.

[32]  Manfred K. Warmuth,et al.  Path Kernels and Multiplicative Updates , 2002, J. Mach. Learn. Res..

[33]  Nicolás Marín,et al.  Review of Data on the Web: from relational to semistructured data and XML by Serge Abiteboul, Peter Buneman, and Dan Suciu. Morgan Kaufmann 1999. , 2003, SGMD.