Discovering Domain-Specific Composite Kernels

Authors: Tom Briggs, and Tim Oates

Book Title: Proceedings of the Twentieth National Conference on Artificial Intelligence and the Seventeenth Annual Conference on Innovative Applications of Artificial intelligence

Date: July 09, 2005

Abstract: Kernel-based data mining algorithms, such as Support Vector Machines, project data into high-dimensional feature spaces, wherein linear decision surfaces correspond to non-linear decision surfaces in the original feature space. Choosing a kernel amounts to choosing a high-dimensional feature space, and is thus a crucial step in the data mining process. Despite this fact, and as a result of the difficulty of establishing that a function is a positive definite kernel, only a few standard kernels (e.g. polynomial and Gaussian) are typically used. We propose a method for searching over a space of kernels for composite kernels that are guaranteed to be positive definite, and that are tuned to produce a feature space appropriate for a given dataset. Composite kernel functions are easily interpreted by humans, in contrast to the output of other work on kernel tuning. Empirical results demonstrate that our method often finds composite kernels that yield higher classification accuracy than the standard kernels.

Type: InProceedings

Publisher: AAAI Press

Pages: 732-739

Google Scholar: search

Number of downloads: 202

Available for download as

size: 190900 bytes

Bookmark at: Digg | Del.icio.us | Connotea | CiteULike