An Adaptive Version of the Boost by Majority Algorithm
Abstract
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.
Cite
Text
Freund. "An Adaptive Version of the Boost by Majority Algorithm." Annual Conference on Computational Learning Theory, 1999. doi:10.1145/307400.307419Markdown
[Freund. "An Adaptive Version of the Boost by Majority Algorithm." Annual Conference on Computational Learning Theory, 1999.](https://mlanthology.org/colt/1999/freund1999colt-adaptive/) doi:10.1145/307400.307419BibTeX
@inproceedings{freund1999colt-adaptive,
title = {{An Adaptive Version of the Boost by Majority Algorithm}},
author = {Freund, Yoav},
booktitle = {Annual Conference on Computational Learning Theory},
year = {1999},
pages = {102-113},
doi = {10.1145/307400.307419},
url = {https://mlanthology.org/colt/1999/freund1999colt-adaptive/}
}