131 search results - page 2 / 27 » Two new regularized AdaBoost algorithms |
KDD
1999
ACM
15 years 1 months ago
1999
ACM
We propose to use AdaBoost to efficiently learn classifiers over very large and possibly distributed data sets that cannot fit into main memory, as well as on-line learning wher...
NIPS
2001
14 years 11 months ago
2001
We derive an equivalence between AdaBoost and the dual of a convex optimization problem, showing that the only difference between minimizing the exponential loss used by AdaBoost ...
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
We describe a new method for learning the conditional probability distribution of a binary-valued variable from labelled training examples. Our proposed Compositional Noisy-Logica...
CVPR
2010
IEEE
14 years 9 months ago
2010
IEEE
Transfer learning allows leveraging the knowledge of source domains, available a priori, to help training a classifier for a target domain, where the available data is scarce. Th...
COLT
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. We describe several improvements to Freund and Schapire's AdaBoost boosting algorithm, particularly in a setting in which hypotheses may assign confidences to each o...