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...

Deskribapen osoa

Xehetasun bibliografikoak

Argitaratua izan da:	Machine learning. 54, 1 (2004).
Egile nagusia:	Van Gestel, Tony
Formatua:	Artikulua
Hizkuntza:	English
Gaiak:	Least squares support vector machines. Multiclass support vector machines. Sparse approximation.