Improved Iterative Sparseness for Least Squares Support Vector Machines

Authors

ZHONG Lu-sheng, School of Electrical and Electronic Engineering, East China Jiaotong University, Nanchang 330013, ChinaFollow
CHEN Li-yong, School of Electrical and Electronic Engineering, East China Jiaotong University, Nanchang 330013, ChinaFollow
GONG Jin-hong, School of Electrical and Electronic Engineering, East China Jiaotong University, Nanchang 330013, ChinaFollow
ZHU Zhen-min, School of Electrical and Electronic Engineering, East China Jiaotong University, Nanchang 330013, ChinaFollow

Author Country (or Countries)

China

Abstract

An improved iterative sparse algorithm is proposed to accelerate the execution of sparse least squares support vector machines(LS-SVM). Firstly, the technique of iterative approximation to the L0-norm is used to sparsify the LS-SVM for regression. However, each iteration requires solving a linear system with expensive computation compared to training a single LS-SVM. In this paper, improved conjugate gradient (ICG) method is given to reduce the computational cost, which is based on transforming the constrained primal problem in LS-SVM into an unconstrained minimization problem. Then the solution to the unconstrained minimization problem is obtained by using the CG method only once at each iteration. Finally, the result of numerical experiment shows that the proposed method get sparse LS-SVM model with significant reduction in computational cost.

Recommended Citation

Lu-sheng, ZHONG; Li-yong, CHEN; Jin-hong, GONG; and Zhen-min, ZHU (2015) "Improved Iterative Sparseness for Least Squares Support Vector Machines," Applied Mathematics & Information Sciences: Vol. 09: Iss. 6, Article 57.
Available at: https://digitalcommons.aaru.edu.jo/amis/vol09/iss6/57