Kernels based on weighted Levenshtein distance

In some real world applications, the sample could be described as a string of symbols rather than a vector of real numbers. It is necessary to determine the similarity or dissimilarity of two strings in many training algorithms. The widely used notion of similarity of two strings with different lengths is the weighted Levenshtein distance (WLD), which implies the minimum total weights of single symbol insertions, deletions and substitutions required to transform one string into another. In order to incorporate prior knowledge of strings into kernels used in support vector machine and other kernel machines, we utilize variants of this distance to replace distance measure in the RBF and exponential kernels and inner product in polynomial and sigmoid kernels, and form a new class of string kernels: Levenshtein kernels in this paper. Combining our new kernels with support vector machine, the error rate and variance on UCI splice site recognition dataset over 20 run is 5.88/spl mnplus/0.53, which is better than the best result 9.5/spl mnplus/0.7 from other five training algorithms.

[1]  Chitra Dorai,et al.  New kernels for analyzing multimodal data in multimedia using kernel machines , 2002, Proceedings. IEEE International Conference on Multimedia and Expo.

[2]  Gunnar Rätsch,et al.  Engineering Support Vector Machine Kerneis That Recognize Translation Initialion Sites , 2000, German Conference on Bioinformatics.

[3]  Vladimir I. Levenshtein,et al.  Binary codes capable of correcting deletions, insertions, and reversals , 1965 .

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

[5]  Motoaki Kawanabe,et al.  Asymptotic Properties of the Fisher Kernel , 2004, Neural Computation.

[6]  Gunnar Rätsch,et al.  New Methods for Splice Site Recognition , 2002, ICANN.

[7]  B. Scholkopf,et al.  Fisher discriminant analysis with kernels , 1999, Neural Networks for Signal Processing IX: Proceedings of the 1999 IEEE Signal Processing Society Workshop (Cat. No.98TH8468).

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

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

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

[11]  Gunnar Rätsch,et al.  A New Discriminative Kernel from Probabilistic Models , 2001, Neural Computation.

[12]  David Haussler,et al.  Using the Fisher Kernel Method to Detect Remote Protein Homologies , 1999, ISMB.

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

[14]  Marc G. Genton,et al.  Classes of Kernels for Machine Learning: A Statistics Perspective , 2002, J. Mach. Learn. Res..