Improved sparse least-squares support vector machines
From MaRDI portal
Publication:1852050
DOI10.1016/S0925-2312(02)00606-9zbMath1006.68767OpenAlexW2014991763MaRDI QIDQ1852050
Nicola L. C. Talbot, Gavin C. Cawley
Publication date: 9 January 2003
Published in: Neurocomputing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0925-2312(02)00606-9
Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)
Related Items (8)
Efficient sparse least squares support vector machines for pattern classification ⋮ Optimally regularised kernel Fisher discriminant classification ⋮ A faster gradient ascent learning algorithm for nonlinear SVM ⋮ Fast exact leave-one-out cross-validation of sparse least-squares support vector machines ⋮ Online independent reduced least squares support vector regression ⋮ The key theorem and the bounds on the rate of uniform convergence of learning theory on Sugeno measure space ⋮ Model selection for the LS-SVM. Application to handwriting recognition ⋮ Supervised pre-clustering for sparse regression
This page was built for publication: Improved sparse least-squares support vector machines
