227 search results - page 18 / 46 » A PAC Bound for Approximate Support Vector Machines |
PODS
2009
ACM
14 years 8 months ago
2009
ACM
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...
CIARP
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. It has been shown that many kernel methods can be equivalently formulated as minimal-enclosing-ball (MEB) problems in certain feature space. Exploiting this reduction eff...
COLT
2001
Springer
13 years 12 months ago
2001
Springer
We investigate the use of certain data-dependent estimates of the complexity of a function class, called Rademacher and Gaussian complexities. In a decision theoretic setting, we ...
IJCNN
2007
IEEE
14 years 1 months ago
2007
IEEE
—Starting from the strict interpolation equations for multivariate polynomials, an upper bound is developed for the number of patterns that can be memorized by a nonlinear feedfo...
JMLR
2010
13 years 2 months ago
2010
This paper proposes a novel algorithm for semisupervised learning. This algorithm learns graph cuts that maximize the margin with respect to the labels induced by the harmonic fun...