70 search results - page 3 / 14 » Using Generalization Error Bounds to Train the Set Covering ... |
JMLR
2008
13 years 7 months ago
2008
Feature ranking is a fundamental machine learning task with various applications, including feature selection and decision tree learning. We describe and analyze a new feature ran...
COLT
1999
Springer
13 years 12 months ago
1999
Springer
The empirical error on a test set, the hold-out estimate, often is a more reliable estimate of generalization error than the observed error on the training set, the training estim...
COLT
2000
Springer
14 years 4 hour ago
2000
Springer
Haussler, Kearns, Seung and Tishby introduced the notion of a shell decomposition of the union bound as a means of understanding certain empirical phenomena in learning curves suc...
ML
2002
ACM
13 years 7 months ago
2002
ACM
For two-class datasets, we provide a method for estimating the generalization error of a bag using out-of-bag estimates. In bagging, each predictor (single hypothesis) is learned ...
COLT
2001
Springer
14 years 5 days ago
2001
Springer
We consider geometric conditions on a labeled data set which guarantee that boosting algorithms work well when linear classifiers are used as weak learners. We start by providing ...