Sciweavers

227 search results - page 2 / 46
» A PAC Bound for Approximate Support Vector Machines
Sort
View
COLT
2003
Springer
13 years 11 months ago
Maximum Margin Algorithms with Boolean Kernels
Recent work has introduced Boolean kernels with which one can learn linear threshold functions over a feature space containing all conjunctions of length up to k (for any 1 ≤ k ...
Roni Khardon, Rocco A. Servedio
NIPS
2003
13 years 7 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
JMLR
2008
104views more  JMLR 2008»
13 years 6 months ago
Nearly Uniform Validation Improves Compression-Based Error Bounds
This paper develops bounds on out-of-sample error rates for support vector machines (SVMs). The bounds are based on the numbers of support vectors in the SVMs rather than on VC di...
Eric Bax