Benchmarking Least Squares Support Vector Machine Classifiers.
In Support Vector Machines (SVMs), the solution of the classification problem is characterized by a (convex) quadratic programming (QP) problem. In a modified version of SVMs, called Least Squares SVM classifiers (LS-SVMs), a least squares cost function is proposed so as to obtain a linear set of eq...
| Publicat a: | Machine learning. 54, 1 (2004). |
|---|---|
| Autor principal: | |
| Format: | Article |
| Idioma: | English |
| Matèries: |