Sciweavers

3378 search results - page 47 / 676
» Learning in Friedberg Numberings
Sort
View
84
Voted
KAIS
2010
80views more  KAIS 2010»
14 years 11 months ago
Semi-supervised learning by disagreement
In many real-world tasks there are abundant unlabeled examples but the number of labeled training examples is limited, because labeling the examples requires human efforts and exp...
Zhi-Hua Zhou, Ming Li
99
Voted
COLT
1994
Springer
15 years 4 months ago
Lower Bounds on the VC-Dimension of Smoothly Parametrized Function Classes
We examine the relationship between the VCdimension and the number of parameters of a smoothly parametrized function class. We show that the VC-dimension of such a function class ...
Wee Sun Lee, Peter L. Bartlett, Robert C. Williams...
117
Voted
SIAMJO
2010
125views more  SIAMJO 2010»
14 years 7 months ago
Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the r...
Shai Shalev-Shwartz, Nathan Srebro, Tong Zhang
127
Voted
TNN
2010
143views Management» more  TNN 2010»
14 years 7 months ago
Using unsupervised analysis to constrain generalization bounds for support vector classifiers
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...
Sergio Decherchi, Sandro Ridella, Rodolfo Zunino, ...
ICAISC
2004
Springer
15 years 5 months ago
Comparison of Instances Seletion Algorithms I. Algorithms Survey
Abstract. Several methods were proposed to reduce the number of instances (vectors) in the learning set. Some of them extract only bad vectors while others try to remove as many in...
Norbert Jankowski, Marek Grochowski