New support vector algorithms with parametric insensitive/margin model

In this paper, a modification of vv-support vector machines (vv-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 vv-SVM, the proposed support vector algorithms have the advantage of using the parameter 0≤v≤10≤v≤1 for controlling the number of support vectors. To be more precise, vv 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.