We use cookies to improve your experience with our site.
Kilho Shin, Tetsuji Kuboyama. A Generalization of Haussler's Convolution Kernel &mdash|Mapping Kernel and Its Application to Tree Kernels[J]. Journal of Computer Science and Technology, 2010, 25(5): 1040-1054. DOI: 10.1007/s11390-010-1082-7
Citation: Kilho Shin, Tetsuji Kuboyama. A Generalization of Haussler's Convolution Kernel &mdash|Mapping Kernel and Its Application to Tree Kernels[J]. Journal of Computer Science and Technology, 2010, 25(5): 1040-1054. DOI: 10.1007/s11390-010-1082-7

A Generalization of Haussler's Convolution Kernel &mdash|Mapping Kernel and Its Application to Tree Kernels

  • Haussler's convolution kernel provides an effective framework for engineering positive semidefinite kernels, and has a wide range of applications. On the other hand, the mapping kernel that we introduce in this paper is its natural generalization, and will enlarge the range of application significantly. Our main theorem with respect to positive semidefiniteness of the mapping kernel (1) implies Haussler's theorem as a corollary, (2) exhibits an easy-to-check necessary and sufficient condition for mapping kernels to be positive semidefinite, and (3) formalizes the mapping kernel so that significant flexibility is provided in engineering new kernels. As an evidence of the effectiveness of our results, we present a framework to engineer tree kernels. The tree is a data structure widely used in many applications, and tree kernels provide an effective method to analyze tree-type data. Thus, not only is the framework important as an example but also as a practical research tool. The description of the framework accompanies a survey of the tree kernels in the literature, where we see that 18 out of the 19 surveyed tree kernels of different types are instances of the mapping kernel, and examples of novel interesting tree kernels.
  • loading

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return