.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Large margin
Kernel methods
Support vector machines
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
7.2W
机构
引用论文
A general kernelization framework for learning algorithms based on kernel PCA.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
分享收藏Analysis of Pressure Sensitive Adhesives by GC/MS and GC/AED with Temperature Programmable Pyrolyzer
PREAI
分享收藏分享收藏
查看更多内容