Порівняння методів

	AdaBoost	Ансамбль беггінгу	Градiєнтний бустинг
Галузь	Машинне навчання	Ансамблеве навчання	Машинне навчання
Родина	Machine learning	Machine learning	Machine learning
Рік появи	1997	1996	2001
Автор методу	Freund, Y. & Schapire, R.E.	Leo Breiman	Friedman, J. H.
Тип	Ensemble (sequential boosting of weak learners)	parallel ensemble	Ensemble (sequential boosting of decision trees)
Основоположне джерело	Freund, Y. & Schapire, R.E. (1997). A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting. Journal of Computer and System Sciences, 55(1), 119–139.	Breiman, L. (1996). Bagging predictors. Machine Learning, 24(2), 123-140.	Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232.
Інші назви	AdaBoost (Adaptive Boosting), adaptive boosting, adaptif artırma	bootstrap aggregating	Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
Пов'язані	5	4	5
Підсумок	AdaBoost (Adaptive Boosting) is the original boosting algorithm, introduced by Yoav Freund and Robert Schapire in 1997, that combines a sequence of simple weak learners by giving more weight to the observations they get wrong. The forerunner of gradient boosting, it is simple, interpretable, and a strong baseline for classification.	Bagging, short for bootstrap aggregating, is an ensemble method that reduces variance by training multiple copies of a single learning algorithm on different random subsets of the training data. Each subset is created via bootstrap sampling—randomly drawing samples with replacement. Predictions are combined through majority voting (classification) or averaging (regression). Introduced by Leo Breiman in 1996, bagging forms the foundation for random forests and is particularly effective for reducing overfitting in high-variance models.	Gradient Boosting is an ensemble learning method, formalised by Jerome H. Friedman in 2001, that combines a sequence of weak learners — typically shallow decision trees — so that each new tree is fitted to minimise the residual errors of the trees before it. It is the core algorithm behind popular implementations such as XGBoost, LightGBM and CatBoost.