Multiclass least squares support vector machines
Authors:
- J.A.K. SuykensJSJ.A.K. Suykens
- J. VandewalleJVJ. Vandewalle
- 22 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2 (10987576) , 900-903
Abstract
We present an extension of least squares support vector machines (LS-SVMs) to the multiclass case. While standard SVM solutions involve solving quadratic or linear programming problems, the least squares version of SVMs corresponds to solving a set of linear equations, due to equality instead of inequality constraints in the problem formulation. In LS-SVMs the Mercer condition is still applicable. Hence several type of kernels such as polynomial, RBFs and MLPs can be used. The multiclass case that we discuss here is related to classical neural net approaches for classification where multi-classes are encoded by considering multiple outputs for the network. Efficient methods for solving large scale LS-SVMs are available.Keywords
This publication has 8 references indexed in Scilit:
- Least Squares Support Vector Machine ClassifiersNeural Processing Letters, 1999
- An Equivalence Between Sparse Approximation and Support Vector MachinesNeural Computation, 1998
- The connection between regularization operators and support vector kernelsNeural Networks, 1998
- The Support Vector Method of Function Estimation1998
- Comparing support vector machines with Gaussian kernels to radial basis function classifiersIEEE Transactions on Signal Processing, 1997
- On the Stability of Null-Space Methods for KKT SystemsSIAM Journal on Matrix Analysis and Applications, 1997
- Neural Networks for Pattern Recognition1995
- The Nature of Statistical Learning Theory1995