A Note on Support Vector Machines Degeneracy

A Note on Support Vector Machines Degeneracy

When training Support Vector Machines (SVMs) over non-separable data sets, one sets the threshold $b$ using any dual cost coefficient that is strictly between the bounds of $0$ and $C$. We show that there exist SVM training problems with dual optimal solutions with all coefficients at bounds,...

Full description

Bibliographic Details
Main Authors: Rifkin, Ryan, Pontil, Massimiliano, Verri, Alessandro
Language:en_US
Published: 2004
Subjects:
AI
MIT
Artificial Intelligence
Support Vector Machines
Scale Sensitive Loss Function
Statistical Learning Theory.
Online Access:http://hdl.handle.net/1721.1/7291

Internet

http://hdl.handle.net/1721.1/7291

Similar Items