Solving Multi-class Pattern Recognition Problems with Tree-Structured Support Vector Machines

  • Authors:
  • Friedhelm Schwenker

  • Affiliations:
  • -

  • Venue:
  • Proceedings of the 23rd DAGM-Symposium on Pattern Recognition
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

Support vector machines (SVM) are learning algorithms derived from statistical learning theory. The SVMapproac h was originally developed for binary classification problems. In this paper SVMarc hitectures for multi-class classification problems are discussed, in particular we consider binary trees of SVMs to solve the multi-class problem. Numerical results for different classifiers on a benchmark data set of handwritten digits are presented.