Jämför metoder

	Boosting	Gradient Boosting	Semi-övervakad Boosting
Ämnesområde	Maskininlärning	Maskininlärning	Maskininlärning
Familj	Machine learning	Machine learning	Machine learning
Ursprungsår	1990–1997	2001	1999–2009
Upphovsperson	Schapire, R. E.; Freund, Y.	Friedman, J. H.	Mallapragada, P. K.; Bennett, K. P.; and others
Typ	Sequential ensemble (iterative reweighting)	Ensemble (sequential boosting of decision trees)	Semi-supervised ensemble method
Ursprungskälla	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.	Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232.	Mallapragada, P. K., Jin, R., Jain, A. K., & Liu, Y. (2009). SemiBoost: Boosting for Semi-supervised Learning. IEEE Transactions on Pattern Analysis and Machine Intelligence, 31(11), 2000–2014.
Alias	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble	Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine	SemiBoost, SSL boosting, boosting with unlabeled data, semi-supervised ensemble boosting
Närliggande	6	5	5
Sammanfattning	Boosting is a sequential ensemble technique that converts many simple, barely-better-than-chance learners into a single highly accurate model by repeatedly focusing training on the examples that previous learners got wrong, then combining all learners with weights proportional to their individual accuracy.	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.	Semi-supervised Boosting is an ensemble learning paradigm that extends classical boosting algorithms — such as AdaBoost — to exploit both labeled and unlabeled data. By propagating label information through a similarity structure over unlabeled instances, it trains stronger classifiers than supervised boosting alone when labeled data are scarce.