Support Vector Machines are Universally Consistent
β Scribed by Ingo Steinwart
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 220 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0885-064X
No coin nor oath required. For personal study only.
β¦ Synopsis
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 R d and regularization parameter c n ΒΌ n bΓ1 is universally consistent, if n is the training set size and 05b51=d: # 2002 Elsevier Science (USA)
π SIMILAR VOLUMES
In this paper we apply a recently proposed technique of optimal control by support vector machines (SVMs) to chaos control. Vapnik's support vector method, which is based on the structural risk minimization principle and has been very successful in classi"cation and function estimation problems, is
A new method has been developed for prediction of transmembrane helices using support vector machines. Different coding schemes of protein sequences were explored, and their performances were assessed by crossvalidation tests. The best performance method can predict the transmembrane helices with se