Support vector machines for multi-class pattern recognition.

Abstract

. The solution of binary classification problems using support vector machines (SVMs) is well developed, but multi-class problems with more than two classes have typically been solved by combining independently produced binary classifiers. We propose a formulation of the SVM that enables a multi-class pattern recognition problem to be solved in a single optimisation. We also propose a similar generalization of linear programming machines. We report experiments using bench-mark datasets in which these two methods achieve a reduction in the number of support vectors and kernel calculations needed.

Cite this paper

@article{weston1999support,
  title = {{Support vector machines for multi-class pattern recognition.}},
  author = {Weston, Jason and Watkins, Chris},
  pages = {219--224},
  year = {1999}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers