Pairwise support vector machines and their application to large scale problems

  • Authors:
  • Carl Brunner;Andreas Fischer;Klaus Luig;Thorsten Thies

  • Affiliations:
  • Institute for Numerical Mathematics, Technische Universität Dresden, Dresden, Germany;Institute for Numerical Mathematics, Technische Universität Dresden, Dresden, Germany;Cognitec Systems GmbH, Dresden, Germany;Cognitec Systems GmbH, Dresden, Germany

  • Venue:
  • The Journal of Machine Learning Research
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Pairwise classification is the task to predict whether the examples a,b of a pair (a,b) belong to the same class or to different classes. In particular, interclass generalization problems can be treated in this way. In pairwise classification, the order of the two input examples should not affect the classification result. To achieve this, particular kernels as well as the use of symmetric training sets in the framework of support vector machines were suggested. The paper discusses both approaches in a general way and establishes a strong connection between them. In addition, an efficient implementation is discussed which allows the training of several millions of pairs. The value of these contributions is confirmed by excellent results on the labeled faces in the wild benchmark.