On the Relationship Between the Support Vector Machine for Classification and Sparsified Fisher‘s Linear Discriminant

  • Authors:
  • Amnon Shashua

  • Affiliations:
  • Institute of Computer Science, Hebrew University of Jerusalem, 91904 Jerusalem, Israel. http://www.cs.huji.ac.il/∼shashua/

  • Venue:
  • Neural Processing Letters
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

We show that the orientation and location of the separating hyperplane for 2-class supervised pattern classification obtained by the Support Vector Machine (SVM) proposed by Vapnik and his colleagues, is equivalent to the solution obtained by Fisher‘s Linear Discriminant on the set of Support Vectors. In other words, SVM can be seen as a way to ’sparsify‘ Fisher‘s Linear Discriminant in order to obtain the most generalizing classification from the training set.