Efficient sparse least squares support vector machines for pattern classification
From MaRDI portal
Publication:316308
DOI10.1016/j.camwa.2013.06.028zbMath1381.68252MaRDI QIDQ316308
Zhiquan Qi, Yong Shi, Ying-Jie Tian, Xu-Chan Ju
Publication date: 27 September 2016
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2013.06.028
62H30: Classification and discrimination; cluster analysis (statistical aspects)
68T05: Learning and adaptive systems in artificial intelligence
68T10: Pattern recognition, speech recognition
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Benchmarking least squares support vector machine classifiers
- Fast exact leave-one-out cross-validation of sparse least-squares support vector machines
- Model selection for the LS-SVM. Application to handwriting recognition
- Weighted least squares support vector machines: robustness and sparse approximation
- Improved sparse least-squares support vector machines
- Support-vector networks
- Optimized fixed-size kernel models for large data sets
- SMO Algorithm for Least-Squares SVM Formulations
- Efficient computations for large least square support vector machine classifiers
- Leave-One-Out Bounds for Support Vector Regression Model Selection
- Multicategory proximal support vector machine classifiers