Home > Papers

 
 
An accelerated sequential minimal optimization method for the least squares support vector machine
Liu Siyi 1,Liu Jianxun 2 *
1.College of Mathematics and Statistics, Chongqing University, Chongqing 401331;School of Mathematics and physics，GuangXi University for Nationalities，Nanning 530006
2.School of Mathematics and physics ， GuangXi University for Nationalities ， Nanning 530006
*Correspondence author
#Submitted by
Subject:
Funding: none
Opened online:16 March 2023
Accepted by: none
Citation: Liu Siyi,Liu Jianxun.An accelerated sequential minimal optimization method for the least squares support vector machine[OL]. [16 March 2023] http://en.paper.edu.cn/en_releasepaper/content/4759470
 
 
Least squares support vector machine(LS-SVM) is an important variant of traditional support vector machine, which is used to solve pattern recognition and prediction. We propose an improved version of the Sequential minimum optimization(SMO) algorithm for training LS-SVM, based on a acclerated grdient method. In this paper we consider adding a new point to capture previous update information. We adopt the idea of Nesterov acceleration method, which gets intermediate points from previous update information and then updates the new iteration point. we show experimentally that the improvement method can significantly reduce the number of iterations, and the training time of LS-SVM can also be reduced in the improvement first-order SMO.
Keywords:Least squares support vector machine; Sequential minimum optimization; Nesterov acceleration method
 
 
 

For this paper
  • ● PDF (0B)
  • ● Revision 0 　　
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags
Add yours

Related Papers

Statistics
PDF Downloaded 16
Bookmarked 0
Recommend 0
Comments Array
Submit your papers