40 search results - page 1 / 8 » The Value of Agreement, a New Boosting Algorithm |
COLT
2005
Springer
13 years 10 months ago
2005
Springer
We present a new generalization bound where the use of unlabeled examples results in a better ratio between training-set size and the resulting classifier’s quality and thus red...
ICML
2005
IEEE
14 years 5 months ago
2005
IEEE
In this paper, we present a new interpretation of AdaBoost.ECC and AdaBoost.OC. We show that AdaBoost.ECC performs stage-wise functional gradient descent on a cost function, defin...
NECO
2006
13 years 4 months ago
2006
The application of boosting technique to the regression problems has received relatively little attention in contrast to the research aimed at classification problems. This paper ...
PDCAT
2005
Springer
13 years 10 months ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
UAI
2008
13 years 6 months ago
2008
In many machine learning problems, labeled training data is limited but unlabeled data is ample. Some of these problems have instances that can be factored into multiple views, ea...