ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Journal of Complexity
Volume 18, Issue 3, September 2002, Pages 768-791
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (219 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1006/jcom.2002.0642    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2002 Elsevier Science (USA). All rights reserved.

Regular Article

Support Vector Machines are Universally Consistent

Ingo Steinwart1

Mathematisches Institut, Friedrich-Schiller-Universität, 07743, Jena, Germanyf1

Received 15 June 2001. 
Available online 5 September 2002.

Purchase the full-text article



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 Image d and regularization parameter cn=nβ−1 is universally consistent, if n is the training set size and 0<β<1/d.


Journal of Complexity
Volume 18, Issue 3, September 2002, Pages 768-791
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.