PubMed · 12590817
SMO algorithm for least-squares SVM formulations.
Abstract
This article extends the well-known SMO algorithm of support vector machines (SVMs) to least-squares SVM formulations that include LS-SVM classification, kernel ridge regression, and a particular form of regularized kernel Fisher discriminant. The algorithm is shown to be asymptotically convergent. It is also extremely easy to implement. Computational experiments show that the algorithm is fast and scales efficiently (quadratically) as a function of the number of examples.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
S S Keerthi, S K Shevade. 2003. SMO algorithm for least-squares SVM formulations.. https://doi.org/10.1162/089976603762553013. https://searchpubmed.org/record/pubmed%3A12590817/smo-algorithm-for-least-squares-svm-formulations
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Search PubMed by Indiciae: BibTeX · RIS.