Training sparse least squares support vector machines by the QR decomposition
From MaRDI portal
Publication:2182874
Recommendations
Cites work
- A novel sparse least squares support vector machines
- Bayesian Framework for Least-Squares Support Vector Machine Classifiers, Gaussian Processes, and Kernel Fisher Discriminant Analysis
- Fast exact leave-one-out cross-validation of sparse least-squares support vector machines
- scientific article; zbMATH DE number 5957374 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- scientific article; zbMATH DE number 823069 (Why is no real title available?)
- In defense of one-vs-all classification
- Kernel matching pursuit
- SMO Algorithm for Least-Squares SVM Formulations
- Weighted least squares support vector machines: robustness and sparse approximation
Cited in
(1)
This page was built for publication: Training sparse least squares support vector machines by the QR decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2182874)