.png){kind=icon}
返回
An efficient support vector machine cone programming for learning method with second-order large-scale problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-005-4609-9.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we propose a new fast learning algorithm for the support vector machine (SVM). The proposed method is based on the technique of second-order cone programming. We reformulate the SVM's quadratic programming problem into the second-order cone programming problem. The proposed method needs to decompose the kernel matrix of SVM's optimization problem, and the decomposed matrix is used in the new optimization problem. Since the kernel matrix is positive semidefinite, the dimension of the decomposed matrix can be reduced by decomposition (factorization) methods. The performance of the proposed method depends on the dimension of the decomposed matrix. Experimental results show that the proposed method is much faster than the quadratic programming solver LOQO if the dimension of the decomposed matrix is small enough compared to that of the kernel matrix. The proposed method is also faster than the method proposed in (S. Fine and K. Scheinberg, 2001) for both low-rank and full-rank kernel matrices. The working set selection is an important issue in the SVM decomposition (chunking) method. We also modify Hsu and Lin's working set selection approach to deal with large working set. The proposed approach leads to faster convergence.
Keyword:
second-order cone programming
quadratic programming
Cholesky factorization
eigenvalue decomposition
support vector machine
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
暂无机构信息
引用论文
分享收藏Program‐Modulated Kinetics of Perovskite‐Film Growth by Molecular “Thruster” for High‐Efficiency and Stable Perovskite Solar Cells通过分子“推进器”调控钙钛矿薄膜生长的程序化动力学，用于高效稳定钙钛矿太阳能电池
PREAI
分享收藏Feasible direction decomposition algorithms for training support vector machines.png)
MACHINE LEARNING
OAAI
MACHINE LEARNINGIF2.9
OAAI分享收藏分享收藏
查看更多内容