Copyright © 2002 Elsevier Science (USA). All rights reserved.
Regular Article
Support Vector Machines are Universally Consistent
Received 15 June 2001.
Available online 5 September 2002.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
We show that support vector machines of the 1-norm soft margin type are universally consistent provided that the regularization parameter is chosen in a distinct manner and the kernel belongs to a specific class—the so-called universal kernels—which has recently been considered by the author. In particular it is shown that the 1-norm soft margin classifier with Gaussian RBF kernel on a compact subset X of
d and regularization parameter cn=nβ−1 is universally consistent, if n is the training set size and 0<β<1/d.






E-mail Article
Add to my Quick Links

Cited By in Scopus (24)




