scholarly journals Single Directional SMO Algorithm for Least Squares Support Vector Machines

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Xigao Shao ◽  
Kun Wu ◽  
Bifeng Liao

Working set selection is a major step in decomposition methods for training least squares support vector machines (LS-SVMs). In this paper, a new technique for the selection of working set in sequential minimal optimization- (SMO-) type decomposition methods is proposed. By the new method, we can select a single direction to achieve the convergence of the optimality condition. A simple asymptotic convergence proof for the new algorithm is given. Experimental comparisons demonstrate that the classification accuracy of the new method is not largely different from the existing methods, but the training speed is faster than existing ones.

2003 ◽  
Vol 15 (2) ◽  
pp. 487-507 ◽  
Author(s):  
S. S. Keerthi ◽  
S. K. Shevade

This article extends the well-known SMO algorithm of support vector machines (SVMs) to least-squares SVM formulations that include LS-SVM classification, kernel ridge regression, and a particular form of regularized kernel Fisher discriminant. The algorithm is shown to be asymptotically convergent. It is also extremely easy to implement. Computational experiments show that the algorithm is fast and scales efficiently (quadratically) as a function of the number of examples.


2011 ◽  
Vol 74 (17) ◽  
pp. 3590-3597 ◽  
Author(s):  
Shangbing Gao ◽  
Qiaolin Ye ◽  
Ning Ye

Sign in / Sign up

Export Citation Format

Share Document