Non-uniform multiple kernel learning with cluster-based gating functions

Yadong Mu

doi:10.1016/j.neucom.2010.11.001

2011-03-01

PRE

Yadong Mu *

Bingfeng Zhou

DOI：10.1016/j.neucom.2010.11.001

原文链接

原文求助

摘要

En 中文

Recently, multiple kernel learning (MKL) has gained increasing attention due to its empirical superiority over traditional single kernel based methods. However, most of state-of-the-art MKL methods are uniform in the sense that the relative weights of kernels keep fixed among all data. Here we propose a non-uniform MKL method with a data-dependent gating mechanism, i.e., adaptively determine the kernel weights for the samples. We utilize a soft clustering algorithm and then tune the weight for each cluster under the graph embedding (GE) framework. The idea of exploiting cluster structures is based on the observation that data from the same cluster tend to perform consistently, which thus increases the resistance to noises and results in more reliable estimate. Moreover, it is computationally simple to handle out-of-sample data, whose implicit RKHS representations are modulated by the posterior to each cluster. Quantitative studies between the proposed method and some representative MKL methods are conducted on both synthetic and widely used public data sets. The experimental results well validate its superiorities. (C) 2010 Elsevier B.V. All rights reserved.

Keyword:

Kernel based learning

Multi-kernel learning

Graph embedding