4.7 Article

New support vector algorithms with parametric insensitive/margin model

Journal

NEURAL NETWORKS
Volume 23, Issue 1, Pages 60-73

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.neunet.2009.08.001

Keywords

Support vector machines (SVMs); Regression estimation; Classification; Heteroscedastic noise model; Parametric-insensitive model; Parametric-margin model

Ask authors/readers for more resources

In this paper, a modification of nu-support vector machines (nu-SVM) for regression and classification is described, and the use of a parametric insensitive/margin model with an arbitrary shape is demonstrated. This can be useful in many cases, especially when the noise is heteroscedastic, that is, the noise strongly depends on the input value x. Like the previous nu-SVM, the proposed support vector algorithms have the advantage of using the parameter 0 <= nu <= 1 for controlling the number of support vectors. To be more precise, v is an upper bound on the fraction of training errors and a lower bound on the fraction of support vectors. The algorithms are analyzed theoretically and experimentally. (C) 2009 Elsevier Ltd. 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

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available