השוואת שיטות

	יער אקראי בייסיאני	גרדיאנט בוסטינג	חיזוק חצי-מפוקח
תחום	למידת מכונה	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning	Machine learning
שנת המקור	2015	2001	1999–2009
הוגה השיטה	Taddy, M. et al.	Friedman, J. H.	Mallapragada, P. K.; Bennett, K. P.; and others
סוג	Bayesian ensemble of decision trees	Ensemble (sequential boosting of decision trees)	Semi-supervised ensemble method
מקור מכונן	Taddy, M., Chen, C., Yu, J., & Wyle, M. (2015). Bayesian and Empirical Bayesian Forests. Proceedings of the 32nd International Conference on Machine Learning (ICML 2015), PMLR 37, 967–976.	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.
כינויים	Bayesian Forest, BRF, Empirical Bayesian Forest, posterior random forest	Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine	SemiBoost, SSL boosting, boosting with unlabeled data, semi-supervised ensemble boosting
קשורות	5	5	5
תקציר	Bayesian Random Forest extends the classical random forest by placing a prior distribution over tree structures and leaf parameters, then sampling or approximating the posterior over that ensemble. The result is a set of predictions accompanied by calibrated uncertainty estimates — a capability standard random forests lack — making it valuable when knowing how confident the model is matters as much as the prediction itself.	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.