Vertaile menetelmiä

	Boosting	Random Forest	Puoliohjattu oppiminen
Tieteenala	Koneoppiminen	Koneoppiminen	Koneoppiminen
Menetelmäperhe	Machine learning	Machine learning	Machine learning
Syntyvuosi	1990–1997	2001	1970s–2006 (formalized)
Kehittäjä	Schapire, R. E.; Freund, Y.	Breiman, L.	Vapnik, V. N. and others (community of researchers, 1970s–2000s)
Tyyppi	Sequential ensemble (iterative reweighting)	Ensemble (bagging 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.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.	Chapelle, O., Scholkopf, B., & Zien, A. (Eds.) (2006). Semi-Supervised Learning. MIT Press. ISBN: 978-0-262-03358-9
Rinnakkaisnimet	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble	SSL, semi-supervised machine learning, transductive learning, label-efficient learning
Liittyvät	6	4	5
Tiivistelmä	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.	Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.	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.