Vertaile menetelmiä

	AdaBoost	Gradient Boosting	Puoliohjattu oppiminen
Tieteenala	Koneoppiminen	Koneoppiminen	Koneoppiminen
Menetelmäperhe	Machine learning	Machine learning	Machine learning
Syntyvuosi	1997	2001	1970s–2006 (formalized)
Kehittäjä	Freund, Y. & Schapire, R.E.	Friedman, J. H.	Vapnik, V. N. and others (community of researchers, 1970s–2000s)
Tyyppi	Ensemble (sequential boosting of weak learners)	Ensemble (sequential boosting of decision trees)	Learning paradigm
Alkuperäislähde	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.	Chapelle, O., Scholkopf, B., & Zien, A. (Eds.) (2006). Semi-Supervised Learning. MIT Press. ISBN: 978-0-262-03358-9
Rinnakkaisnimet	AdaBoost (Adaptive Boosting), adaptive boosting, adaptif artırma	Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine	SSL, semi-supervised machine learning, transductive learning, label-efficient learning
Liittyvät	5	5	5
Tiivistelmä	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.	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 learning (SSL) is a machine learning paradigm that trains models using a small set of labeled examples together with a much larger pool of unlabeled data. By leveraging the structure inherent in unlabeled data, SSL achieves accuracy closer to fully supervised models while requiring far fewer costly manual labels — making it practical when labeling is expensive, slow, or resource-constrained.