Polynomial Summaries of Positive Semidefinite Kernels

  • Kilho Shin
  • Tetsuji Kuboyama
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4754)


Although polynomials have proven to be useful tools to tailor generic kernels to context of specific applications, little was known about generic rules for tuning parameters (i.e. coefficients) to engineer new positive semidefinite kernels. This not only may hinder intensive exploitation of the flexibility of the kernel method, but also may cause misuse of indefinite kernels. Our main theorem presents a sufficient condition on polynomials such that applying the polynomials to known positive semidefinite kernels results in positive semidefinite kernels. The condition is very simple and therefore has a wide range of applications. In addition, in the case of degree 1, it is a necessary condition as well. We also prove the effectiveness of our theorem by showing three corollaries to it: the first one is a generalization of the polynomial kernels, while the second one presents a way to extend the principal-angle kernels, the trace kernels, and the determinant kernels. The third corollary shows corrected sufficient conditions for the codon-improved kernels and the weighted-degree kernels with shifts to be positive semidefinite.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Cristianini, N., Shawe-Taylor, J.: An Introduction to Support Vector Machines and other kernel-based learning methods. Cambridge University Press, Cambridge (2000)CrossRefMATHGoogle Scholar
  2. 2.
    Wolf, L., Shashua, A.: Learning over sets using kernel principal angles. Journal of Machine Learning Research 4, 913–931 (2003)MathSciNetMATHGoogle Scholar
  3. 3.
    Zhou, S.K.: Trace and determinant kernels between matrices. SCR technical report (2004)Google Scholar
  4. 4.
    Zien, A., Rätsch, G., Mika, S., Schölkopf, B., Lengauer, T., Müller, K.R.: Engineering support vector machine kernels that recognize translation initiation sites. Bioinformatics 16(9), 799–807 (2000)CrossRefGoogle Scholar
  5. 5.
    Rätsch, G., Sonnenburg, S., Schölkopf, B.: Rase: recognition of alternatively spliced exons in C.elegans. Bioinformatics 21, i369–i377 (2005)Google Scholar
  6. 6.
    Yamaguchi, O., Fukui, K., Maeda, K.: Face recognition using temporal image sequence. In: IEEE International Conference on Automatic Face & Gesture Recognition, IEEE Computer Society Press, Los Alamitos (1998)Google Scholar
  7. 7.
    Vishwanathan, S., Smola, A., Vidal, R.: Binet-cauchy kernels on dynamical systems and its application to the analysis of dynamic scenes. International Journal of Computer Vision 73, 95–119 (2007)CrossRefGoogle Scholar
  8. 8.
    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
  9. 9.
    Haussler, D.: Convolution kernels on discrete structures. UCSC-CRL 99-10, Dept. of Computer Science, University of California at Santa Cruz (1999)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Kilho Shin
    • 1
  • Tetsuji Kuboyama
    • 2
  1. 1.Carnegie Mellon CyLabJapan
  2. 2.University of TokyoJapan

Personalised recommendations