227 search results - page 4 / 46 » A PAC Bound for Approximate Support Vector Machines |
ALT
1999
Springer
13 years 11 months ago
1999
Springer
We introduce a new model for learning in the presence of noise, which we call the Nasty Noise model. This model generalizes previously considered models of learning with noise. Th...
CDC
2009
IEEE
13 years 10 months ago
2009
IEEE
—In kernel based regression techniques (such as Support Vector Machines or Least Squares Support Vector Machines) it is hard to analyze the influence of perturbed inputs on the ...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Straightforward classification using kernelized SVMs requires evaluating the kernel for a test vector and each of the support vectors. For a class of kernels we show that one can ...
ICML
2000
IEEE
14 years 8 months ago
2000
IEEE
We study the problem of learning using combinations of machines. In particular we present new theoretical bounds on the generalization performance of voting ensembles of kernel ma...
TNN
2010
13 years 2 months ago
2010
Abstract--A crucial issue in designing learning machines is to select the correct model parameters. When the number of available samples is small, theoretical sample-based generali...