arrow
返回

Three-parameter sequential minimal optimization for support vector machines

delete2011-10-01
delete11
PRE
AI
Y
Yih-Lon Lin *
J
Jer‐Guang Hsieh
H
Hsu-Kun Wu
J
Jyh-Horng Jeng
DOI:10.1016/j.neucom.2011.06.011delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
The well-known sequential minimal optimization (SMO) algorithm is the most commonly used algorithm for numerical solutions of the support vector learning problems. At each iteration in the traditional SMO algorithm, also called 2PSMO algorithm in this paper, it jointly optimizes only two chosen parameters. The two parameters are selected either heuristically or randomly, whilst the optimization with respect to the two chosen parameters is performed analytically. The 2PSMO algorithm is naturally generalized to the three-parameter sequential minimal optimization (3PSMO) algorithm in this paper. At each iteration of this new algorithm, it jointly optimizes three chosen parameters. As in 2PSMO algorithm, the three parameters are selected either heuristically or randomly, whilst the optimization with respect to the three chosen parameters is performed analytically. Consequently, the main difference between these two algorithms is that the optimization is performed at each iteration of the 2PSMO algorithm on a line segment, whilst that of the 3PSMO algorithm on a two-dimensional region consisting of infinitely many line segments. This implies that the maximum can be attained more efficiently by 3PSMO algorithm. Main updating formulae of both algorithms for each support vector learning problem are presented. To assess the efficiency of the 3PSMO algorithm compared with the 2PSMO algorithm, 14 benchmark datasets, 7 for classification and 7 for regression, will be tested and numerical performances are compared. Simulation results demonstrate that the 3PSMO outperforms the 2PSMO algorithm significantly in both executing time and computation complexity. (C) 2011 Elsevier B.V. All rights reserved.
Keyword:
Support vector machine
Sequential minimal optimization
Classification
Regression
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Neurocomputing 封面图
Neurocomputing
IF:
6.5
论文数:
2.5W
被引数:
6.5W

机构

N
national sun yat sen university
学者数:
7.6K
论文数: 7.7K
被引数: 3
I
I Shou University
学者数:
2.7K
论文数: 2.9K
被引数: 17
引用论文

引用论文

Candidate working set strategy based SMO algorithm in support vector machine
err2009-09-01
err16
PREAI
errSong, Xiao-feng; Chen, Wei-min; Chen, Yi-Ping Phoebe; Jiang, Bin
err分享
err收藏
Developing parallel sequential minimal optimization for fast training support vector machine
err2006-12-01
err19
PREAI
errCao, L. J.; Keerthi, S. S.; Ong, C. J.; Uvaraj, P.; Fu, X. J.; Lee, H. P.
err分享
err收藏
Support-vector networks支持向量网络
err1995-09-01
err0
errOAAI
errCorinna Cortes; Vladimir Vapnik
err分享
err收藏
没有更多内容