By Topic

Comparative Analysis of Support Vector Machines Based on Linear and Quadratic Optimization Criteria

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Nefedov, A. ; Dept. of Veterinary Clinical Sci., Univ. of Liverpool, Liverpool, UK ; Jiankuan Ye ; Kulikowski, C. ; Muchnik, I.
more authors

We present results from a comparative empirical study of two methods for constructing support vector machines (SVMs). The first method is the conventional one based on the quadratic programming approach, which builds the optimal separating hyperplane maximizing the margin between two classes (SVM-Q). The second method is based on the linear programming approach suggested by Vapnik to build a separating hyperplane with the minimum number of support vectors (SVM-L). Using synthetic data from two classes, we compare the classification performance of these SVMs, with a geometrical comparison of their separating hyperplanes and support vectors. We show that both classifiers achieve practically identical classification accuracy and generalization performance. However, SVM-L has many fewer support vectors than SVM-Q. We also prove that, in contrast to SVM-Q, which selects support vectors from the margin between two classes, support vectors of SVM-L lie on the furthermost borders of the classes, at the maximum distance from the opposite class.

Published in:

Machine Learning and Applications, 2009. ICMLA '09. International Conference on

Date of Conference:

13-15 Dec. 2009