Sciweavers

Share
NIPS
2008

Relative Margin Machines

11 years 1 months ago
Relative Margin Machines
In classification problems, Support Vector Machines maximize the margin of separation between two classes. While the paradigm has been successful, the solution obtained by SVMs is dominated by the directions with large data spread and biased to separate the classes by cutting along large spread directions. This article proposes a novel formulation to overcome such sensitivity and maximizes the margin relative to the spread of the data. The proposed formulation can be efficiently solved and experiments on digit datasets show drastic performance improvements over SVMs.
Pannagadatta K. Shivaswamy, Tony Jebara
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2008
Where NIPS
Authors Pannagadatta K. Shivaswamy, Tony Jebara
Comments (0)
books