Journal
NEUROCOMPUTING
Volume 71, Issue 13-15, Pages 3020-3025Publisher
ELSEVIER
DOI: 10.1016/j.neucom.2007.12.032
Keywords
support vector machines; smooth Ramp loss; concave-convex procedure
Categories
Ask authors/readers for more resources
In this paper, we propose a novel robust support vector machine based on the smooth Ramp loss, which has strong ability of suppressing the influences of outliers. The concave-convex procedure (CCCP) is utilized to transform the associated non-convex optimization into a convex one. Then, a Newton-type algorithm is developed to solve the resulting primal optimization of robust support vector machine, and the convergence property and the complexity are discussed. Experimental results show that the proposed approach has significant robustness to outliers and yields better generalization performance than the classical support vector machines on both synthetic and real data sets. (c) 2008 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available