A step-by-step explanation of how AdaBoost works, using decision trees as weak learners. AdaBoost progressively learns from previous model's mistakes and reweighs instances to improve predictions.
Table of contents
Are you overwhelmed with the amount of information in ML/DS?3 Comments
Sort: