Sciweavers

1037 search results - page 51 / 208
» Learning of Boolean Functions Using Support Vector Machines
Sort
View
CORR
2006
Springer
130views Education» more  CORR 2006»
13 years 7 months ago
Genetic Programming for Kernel-based Learning with Co-evolving Subsets Selection
Abstract. Support Vector Machines (SVMs) are well-established Machine Learning (ML) algorithms. They rely on the fact that i) linear learning can be formalized as a well-posed opti...
Christian Gagné, Marc Schoenauer, Mich&egra...
JMLR
2010
115views more  JMLR 2010»
13 years 2 months ago
Fast and Scalable Local Kernel Machines
A computationally efficient approach to local learning with kernel methods is presented. The Fast Local Kernel Support Vector Machine (FaLK-SVM) trains a set of local SVMs on redu...
Nicola Segata, Enrico Blanzieri
COLT
2001
Springer
14 years 8 days ago
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results
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 ...
Peter L. Bartlett, Shahar Mendelson
NIPS
2004
13 years 9 months ago
Machine Learning Applied to Perception: Decision Images for Gender Classification
We study gender discrimination of human faces using a combination of psychophysical classification and discrimination experiments together with methods from machine learning. We r...
Felix A. Wichmann, Arnulf B. A. Graf, Eero P. Simo...
FOCS
1990
IEEE
13 years 11 months ago
Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
Avrim Blum