A regression approach to LS-SVM and sparse realization based on fast subset selection

Zhang, Jingjing, Li, Kang, Irwin, George W. and Zhao, Wanqing ORCID: https://orcid.org/0000-0001-6160-9547 (2012) A regression approach to LS-SVM and sparse realization based on fast subset selection. In: 2012 10th World Congress on Intelligent Control and Automation, 2012-07-06 - 2012-07-08.

Full text not available from this repository.


The Least Squares Support Vector Machine (LS-SVM) is a modified SVM with a ridge regression cost function and equality constraints. It has been successfully applied in many classification problems. But, the common issue for LS-SVM is that it lacks sparseness, which is a serious drawback in its applications. To tackle this problem, a fast approach is proposed in this paper for developing sparse LS-SVM. First, a new regression solution is proposed for the LS-SVM which optimizes the same objective function for the conventional solution. Based on this, a new subset selection method is then adopted to realize the sparse approximation. Simulation results on different benchmark datasets i.e. Checkerboard, two Gaussian datasets, show that the proposed solution can achieve better objective value than conventional LS-SVM, and the proposed approach can achieve a more sparse LS-SVM than the conventional LS-SVM while provide comparable predictive classification accuracy. Additionally, the computational complexity is significantly decreased.

Item Type: Conference or Workshop Item (Paper)
Faculty \ School: Faculty of Science > School of Computing Sciences
UEA Research Groups: Faculty of Science > Research Groups > Smart Emerging Technologies
Related URLs:
Depositing User: LivePure Connector
Date Deposited: 03 Jul 2020 23:28
Last Modified: 18 Aug 2023 00:55
URI: https://ueaeprints.uea.ac.uk/id/eprint/75888
DOI: 10.1109/WCICA.2012.6357952

Actions (login required)

View Item View Item