Sciweavers

70 search results - page 2 / 14
» Using Generalization Error Bounds to Train the Set Covering ...
Sort
View
COLT
2005
Springer
13 years 11 months ago
Generalization Error Bounds Using Unlabeled Data
We present two new methods for obtaining generalization error bounds in a semi-supervised setting. Both methods are based on approximating the disagreement probability of pairs of ...
Matti Kääriäinen
ICML
1998
IEEE
14 years 6 months ago
A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization
In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...
Michael J. Kearns, Yishay Mansour
TNN
2010
143views Management» more  TNN 2010»
13 years 22 hour 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, ...
COLT
2007
Springer
13 years 11 months ago
Prediction by Categorical Features: Generalization Properties and Application to Feature Ranking
We describe and analyze a new approach for feature ranking in the presence of categorical features with a large number of possible values. It is shown that popular ranking criteria...
Sivan Sabato, Shai Shalev-Shwartz
UAI
2008
13 years 6 months ago
Small Sample Inference for Generalization Error in Classification Using the CUD Bound
Confidence measures for the generalization error are crucial when small training samples are used to construct classifiers. A common approach is to estimate the generalization err...
Eric Laber, Susan Murphy