Efficient model selection for sparse least-square SVMs
Summary: The Forward Least-Squares Approximation (FLSA) SVM is a newly-emerged Least-Square SVM (LS-SVM) whose solution is extremely sparse. The algorithm uses the number of support vectors as the regularization parameter and ensures the linear independency of the support vectors which span the solution. This paper proposed a variant of the FLSA-SVM, namely, Reduced FLSA-SVM which is of reduced computational complexity and memory requirements. The strategy of ``contexts inheritance is introduced to improve the efficiency of tuning the regularization parameter for both the FLSA-SVM and the RFLSA-SVM algorithms. Experimental results on benchmark datasets showed that, compared to the SVM and a number of its variants, the RFLSA-SVM solutions contain a reduced number of support vectors, while maintaining competitive generalization abilities. With respect to the time cost for tuning of the regularize parameter, the RFLSA-SVM algorithm was empirically demonstrated fastest compared to FLSA-SVM, the LS-SVM, and the SVM algorithms.
- A novel sparse least squares support vector machines
- Chaos control using least-squares support vector machines
- Data mining with sparse grids
- Improvements to Platt's SMO Algorithm for SVM Classifier Design
- Kernel matching pursuit
- Weighted least squares support vector machines: robustness and sparse approximation
- Low rank updated LS-SVM classifiers for fast variable selection
- Kernel Least-Squares Models Using Updates of the Pseudoinverse
- Selection methods for extended least squares support vector machines
- A novel sparse least squares support vector machines
- Fast Generalized Cross-Validation Algorithm for Sparse Model Learning
This page was built for publication: Efficient model selection for sparse least-square SVMs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q474543)
