Multiple kernel learning (Mkl) uses a convex combination of kernels where the weight of each kernel is optimized during training. However, Mkl assigns the same weight to a kernel over the whole in- put space. Localized multiple kernel learning (Lmkl) framework extends the Mkl framework to allow combining kernels with difierent weights in difierent regions of the input space by using a gating model. Lmkl extracts the relative importance of kernels in each region whereas Mkl gives their relative importance over the whole input space. In this paper, we generalize the Lmkl framework with a kernel-based gating model and derive the learning algorithm for binary classiflcation. Empirical results on toy classiflcation problems are used to illustrate the algorithm. Ex- periments on two bioinformatics data sets are performed to show that kernel machines can also be localized in a data-dependent way by using kernel values as gating model features. The localized variant achieves signiflcantly higher accuracy on one of the bioinformatics data sets.
[1]
Dmitrij Frishman,et al.
MIPS: a database for genomes and protein sequences
,
2000,
Nucleic Acids Res..
[2]
Jason Weston,et al.
Gene functional classification from heterogeneous data
,
2001,
RECOMB.
[3]
Nello Cristianini,et al.
Learning the Kernel Matrix with Semidefinite Programming
,
2002,
J. Mach. Learn. Res..
[4]
Michael I. Jordan,et al.
Multiple kernel learning, conic duality, and the SMO algorithm
,
2004,
ICML.
[5]
Nello Cristianini,et al.
A statistical framework for genomic data fusion
,
2004,
Bioinform..
[6]
William Stafford Noble,et al.
Nonstationary kernel combination
,
2006,
ICML.
[7]
Wan-Jui Lee,et al.
Kernel Combination Versus Classifier Combination
,
2007,
MCS.
[8]
Yves Grandvalet,et al.
More efficiency in multiple kernel learning
,
2007,
ICML '07.
[9]
Ethem Alpaydin,et al.
Localized multiple kernel learning
,
2008,
ICML '08.