论文信息 - An Adaptive Version of the Boost by Majority Algorithm - 字舞流文

An Adaptive Version of the Boost by Majority Algorithm

We propose a new boosting algorithm. This boosting algorithm is an adaptive version of the boost by majority algorithm and combines bounded goals of the boost by majority algorithm with the adaptivity of AdaBoost.

Yoav Freund | Y. Freund

[1] Yoav Freund,et al. Boosting a weak learning algorithm by majority , 1995, COLT '90.

[2] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1997, EuroCOLT.

[3] Yoav Freund,et al. Boosting the margin: A new explanation for the effectiveness of voting methods , 1997, ICML.

[4] Yoram Singer,et al. Improved Boosting Algorithms Using Confidence-rated Predictions , 1998, COLT' 98.

[5] Peter L. Bartlett,et al. Direct Optimization of Margins Improves Generalization in Combined Classifiers , 1998, NIPS.

[6] Drifting games , 1999, COLT '99.

[7] Yoav Freund,et al. Continuous Drifting Games , 2000, COLT.

[8] J. Friedman. Special Invited Paper-Additive logistic regression: A statistical view of boosting , 2000 .