Precision-based Boosting
Mohammad Hossein Nikravan, Marjan Movahedan, Sandra Zilles
Abstract
AdaBoost is a highly popular ensemble classification method for which many variants have been published. This paper proposes a generic refinement of all of these AdaBoost variants. Instead of assigning weights based on the total error of the base classifiers (as in AdaBoost), our method uses class-specific error rates. On instance x it assigns a higher weight to a classifier predicting label y on x, if that classifier is less likely to make a mistake when it predicts class y. Like AdaBoost, our method is guaranteed to boost weak learners into strong learners. An empirical study on AdaBoost and one of its multi-class versions, SAMME, demonstrates the superiority of our method on datasets with more than 1,000 instances as well as on datasets with more than three classes.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 619147e4-31cb-4426-87d8-459219381e5dRelated papers
- Iterative Weak Learnability and Multiclass AdaBoostIn-Koo Cho, Jonathan A. Libgober, Cheng DingKDD 2024
- Multiclass Boosting and the Cost of Weak LearningNataly Brukhim, Elad Hazan, Shay Moran, Indraneel Mukherjee et al.NeurIPS 2021 · 16 citations
- AdaBoost is not an Optimal Weak to Strong LearnerMikael Møller Høgsgaard, Kasper Green Larsen, Martin RitzertICML 2023 · 8 citations
- Optimal Weak to Strong LearningKasper Green Larsen, Martin RitzertNeurIPS 2022 · 16 citations
- The Many Faces of Optimal Weak-to-Strong LearningMikael Møller Høgsgaard, Kasper Green Larsen, Markus Engelund MathiasenNeurIPS 2024 · 4 citations
