Sciweavers

2 search results - page 1 / 1
» Sparseness of Support Vector Machines---Some Asymptotically ...
Sort
View
NIPS
2003
13 years 5 months ago
Sparseness of Support Vector Machines---Some Asymptotically Sharp Bounds
The decision functions constructed by support vector machines (SVM’s) usually depend only on a subset of the training set—the so-called support vectors. We derive asymptotical...
Ingo Steinwart
COLT
2004
Springer
13 years 10 months ago
Sparseness Versus Estimating Conditional Probabilities: Some Asymptotic Results
One of the nice properties of kernel classifiers such as SVMs is that they often produce sparse solutions. However, the decision functions of these classifiers cannot always be u...
Peter L. Bartlett, Ambuj Tewari