.png){kind=icon}
Return
Multi-class kernel margin maximization for kernel learning
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2016.05.073.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Two-stage multiple kernel learning (MKL) algorithms have been intensively studied due to its high efficiency and effectiveness. Pioneering work on this regard attempts to optimize the combination coefficients by maximizing the multi-class margin of a kernel, while obtaining unsatisfying performance. In this paper, we attribute this poor performance to the way in calculating the multi-class margin of a kernel. In specific, we argue that for each sample only the k-nearest neighbors, while not all samples with the same label, should be selected for calculating the margin. After that, we also develop another sparse variant which is able to automatically identify the nearest neighbors and the corresponding weights of each sample. Extensive experimental results on ten UCI data sets and six MKL benchmark data sets demonstrate the effectiveness and efficiency of the proposed algorithms. (C) 2016 Elsevier B.V. All rights reserved.
Keywords:
Large margin
Kernel methods
Support vector machines
Journal
IF:
6.5
Papers:
2.5W
Citations:
7.0W
Organization
Cited Papers
A general kernelization framework for learning algorithms based on kernel PCA.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
ShareSaveAnalysis of Pressure Sensitive Adhesives by GC/MS and GC/AED with Temperature Programmable Pyrolyzer
PREAI
ShareSaveShareSaveShareSaveShareSaveShareSave
View more