Advertisement

Position-Aware String Kernels with Weighted Shifts and a General Framework to Apply String Kernels to Other Structured Data

  • Kilho Shin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4881)

Abstract

In combination with efficient kernel-base learning machines such as Support Vector Machine (SVM), string kernels have proven to be significantly effective in a wide range of research areas (e.g. bioinformatics, text analysis, voice analysis). Many of the string kernels proposed so far take advantage of simpler kernels such as trivial comparison of characters and/or substrings, and are classified into two classes: the position-aware string kernel which takes advantage of positional information of characters/substrings in their parent strings, and the position-unaware string kernel which does not. Although the positive semidefiniteness of kernels is a critical prerequisite for learning machines to work properly, a little has been known about the positive semidefiniteness of the position-aware string kernel. The present paper is the first paper that presents easily checkable sufficient conditions for the positive semidefiniteness of a certain useful subclass of the position-aware string kernel: the similarity/matching of pairs of characters/substrings is evaluated with weights determined according to shifts (the differences in the positions of characters/substrings). Such string kernels have been studied in the literature but insufficiently. In addition, by presenting a general framework for converting positive semidefinite string kernels into those for richer data structures such as trees and graphs, we generalize our results.

Keywords

Support Vector Machine Positional Information Weighted Shift Parent String Voice Analysis 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Leslie, C., Eskin, E., Noble, W.: The spectrum kernel: a string kernel for svm protein classification. In: 7th Pacific Symposium of Biocomputing (2002)Google Scholar
  2. 2.
    Zien, A., Rätsch, G., Mika, S., Schölkopf, B., Lengauer, T., Müller, K.R.: Engineering support vector machne kernels that recognize translation initiation sites. Bioinformatics 16, 799–807 (2000)CrossRefGoogle Scholar
  3. 3.
    Rätsch, G., Sonnenburg, S., Schölkopf, B.: Rase: recognition of alternatively spliced exons in c.elegans. Bioinformatics 21, 369–377 (2005)CrossRefGoogle Scholar
  4. 4.
    Lodhi, H., Shawe-Taylor, J., Cristianini, N., Watkins, C.J.C.H.: Text classificatio using string kernels. Advances in Neural Information Processing Systems 13 (2001)Google Scholar
  5. 5.
    Shin, K., Kuboyama, T.: Polynomial summaries of positive semidefinite kernels. In: ALT 2007. The 18th International Conference on Algorithmic Learning Theory (to appear)Google Scholar
  6. 6.
    Gärtner, T.: A survey of kernels for structured data. SIGKDD Explorations 5, 49–58 (2003)CrossRefGoogle Scholar
  7. 7.
    Haussler, D.: Convolution kernels on discrete structures. UCSC-CRL 99-10, Dept. of Computer Science, University of California at Santa Cruz (1999)Google Scholar
  8. 8.
    Berg, C., Christensen, J.P.R., Ressel, R.: Harmonic Analysis on semigroups. Theory of positive definite and related functions. Springer, Heidelberg (1984)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Kilho Shin
    • 1
  1. 1.Carnegie Mellon CyLabJapan

Personalised recommendations