.png){kind=icon}
返回
Design of a multiple kernel learning algorithm for LS-SVM by convex programming
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neunet.2011.03.009.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
As a kernel based method, the performance of least squares support vector machine (LS-SVM) depends on the selection of the kernel as well as the regularization parameter (Duan, Keerthi, & Poo, 2003). Cross-validation is efficient in selecting a single kernel and the regularization parameter: however, it suffers from heavy computational cost and is not flexible to deal with multiple kernels. In this paper, we address the issue of multiple kernel learning for LS-SVM by formulating it as semidefinite programming (SDP). Furthermore, we show that the regularization parameter can be optimized in a unified framework with the kernel, which leads to an automatic process for model selection. Extensive experimental validations are performed and analyzed. (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
Least squares support vector machines
Multiple kernel learning
Convex optimization
Semidefinite programming
Quadratically constrained quadratic programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.3
论文数:
7.8K
被引数:
3.0W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容