Efficient model selection for sparse least-square SVMs
DOI10.1155/2013/712437zbMATH Open1299.62053OpenAlexW2068003938WikidataQ59028454 ScholiaQ59028454MaRDI QIDQ474543FDOQ474543
Authors: Xiao-Lei Xia, Suxiang Qian, Xueqin Liu, H. L. Xing
Publication date: 24 November 2014
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/712437
Recommendations
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Cites Work
- Improvements to Platt's SMO Algorithm for SVM Classifier Design
- Chaos control using least-squares support vector machines
- Weighted least squares support vector machines: robustness and sparse approximation
- Kernel matching pursuit
- A novel sparse least squares support vector machines
- Data mining with sparse grids
Cited In (5)
- Fast Generalized Cross-Validation Algorithm for Sparse Model Learning
- Low rank updated LS-SVM classifiers for fast variable selection
- A novel sparse least squares support vector machines
- Selection methods for extended least squares support vector machines
- Kernel Least-Squares Models Using Updates of the Pseudoinverse
Uses Software
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)