• Corpus ID: 15059183

Support vector machines for multi-class pattern recognition

@inproceedings{Weston1999SupportVM,
  title={Support vector machines for multi-class pattern recognition},
  author={Jason Weston and Chris Watkins},
  booktitle={The European Symposium on Artificial Neural Networks},
  year={1999}
}
The solution of binary classi cation 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 classi ers. 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… 

Tables from this paper

Multicategory Support Vector Machines

The MSVM is proposed, which extends the binary SVM to the multicategory case and has good theoretical properties, and an approximate leave-one-out cross-validation function is derived, analogous to the binary case.

Probabilistic Classification Vector Machine for Multi-Class Classification

The PCVM is extended and a multi-class probabilistic classification vector machine (mPCVM) is proposed, which combines the advantages of both the support vector machine and the relevant vector machine, delivering a sparse Bayesian solution to classification problems.

Fisher Consistency of Multicategory Support Vector Machines

This paper reviews several commonly used extensions of the Support Vector Machine and proposes two approaches to make them Fisher consistent, one is to add bounded constraints and the other is to truncate unbounded hinge losses.

A new method for multi-class support vector machines by training least number of classifiers

A novel method is proposed which is different from all the existing ones by constructing the least number of classifiers, it makes better use of the feature space partition, and can fully eliminate the unclassifiable region.

Support Vector Machines for Classification

Support Vector Machines can be thought of as a method for constructing a special kind of rule, called a linear classifier, in a way that produces classifiers with theoretical guarantees of good predictive performance (the quality of classification on unseen data).

Introduction to Binary Support Vector Machines

In this chapter, linear SVMs solve an optimization problem that seeks a maximum margin classifier, defined by a subset of training data points called support vectors, which separates training instances of two classes.

Piecewise Combination of Hyper-Sphere Support Vector Machine for Multi-Class Classification Problems

A piecewise combination of the hyper-sphere support vector machine and the kmeans cluster algorithm is introduced to compute cluster centers for different classes of the data.

Extensions to the support vector method

It is argued that the Support Vector approach is a family of related algorithms that share some important common concepts and methodology and the approach is conceptually elegant and well supported by the theory.

A New Multi-class Classification Method Based On Least Square Support Vector Regression Machine

A novel multi-class support vector machine method is presented, named the Multi-class Least Square Support Vector Regression (MCLS-SVR) by using only one classifier to solve the multi- class problem.
...

References

SHOWING 1-7 OF 7 REFERENCES

Comparison of View-Based Object Recognition Algorithms Using Realistic 3D Models

Two view-based object recognition algorithms are compared: (1) a heuristic algorithm based on oriented filters, and (2) a support vector learning machine trained on low-resolution images of the

The Nature of Statistical Learning Theory

  • V. Vapnik
  • Computer Science
    Statistics for Engineering and Information Science
  • 2000
Setting of the learning problem consistency of learning processes bounds on the rate of convergence of learning processes controlling the generalization ability of learning processes constructing

Statistical learning theory

Presenting a method for determining the necessary and sufficient conditions for consistency of learning process, the author covers function estimates from small data pools, applying these estimations to real-life problems, and much more.

Multicategory discrimination via linear programming

A single linear program is proposed for discriminating between the elements of κ disjoint point sets in the n-dimensional real space Rn . When the conical hulls of the κ sets are (κ−1)-point disjoint

Extracting Support Data for a Given Task

It is observed that three different types of handwritten digit classifiers construct their decision surface from strongly overlapping small subsets of the data base, which opens up the possibility of compressing data bases significantly by disposing of theData which is not important for the solution of a given task.

Statistical Learning Theory. Wiley, New York, 1998. ESANN'1999 proceedings

  • European Symposium on Artificial Neural Networks Bruges (Belgium),
  • 1999

ESANN'1999 proceedings -European Symposium on Artificial Neural Networks Bruges (Belgium)

  • ESANN'1999 proceedings -European Symposium on Artificial Neural Networks Bruges (Belgium)
  • 1999