Three-parameter sequential minimal optimization for support vector machines

Authors:
Yih-Lon Lin;Jer-Guang Hsieh;Hsu-Kun Wu;Jyh-Horng Jeng
Affiliations:
Department of Information Engineering, I-Shou University, Kaohsiung 84001, Taiwan;Department of Electrical Engineering, I-Shou University, Kaohsiung 84001, Taiwan;Department of Electrical Engineering, National Sun Yat-Sen University, Kaohsiung 804, Taiwan;Department of Information Engineering, I-Shou University, Kaohsiung 84001, Taiwan
Venue:
Neurocomputing
Year:
2011

Citing 8
Cited 2

A training algorithm for optimal margin classifiers

COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Support-Vector Networks

Machine Learning
Fast training of support vector machines using sequential minimal optimization

Advances in kernel methods
Efficient optimization of support vector machine learning parameters for unbalanced datasets

Journal of Computational and Applied Mathematics
An improved incremental training algorithm for support vector machines using active query

Pattern Recognition
Candidate working set strategy based SMO algorithm in support vector machine

Information Processing and Management: an International Journal
One-class support vector machines-an application in machine fault detection and classification

Computers and Industrial Engineering
A multi-objective artificial immune algorithm for parameter optimization in support vector machine

Applied Soft Computing

A real-time mathematical computer method for potato inspection using machine vision

Computers & Mathematics with Applications
Nested sequential minimal optimization for support vector machines

ICANN'12 Proceedings of the 22nd international conference on Artificial Neural Networks and Machine Learning - Volume Part II

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.