השוואת שיטות

	שקית בייסיאנית (Bayesian Bagging)	בוסטינג בייסיאני	יער אקראי בייסיאני	בוסטינג	יער אקראי
תחום	למידת מכונה	למידת מכונה	למידת מכונה	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning	Machine learning	Machine learning	Machine learning
שנת המקור	2001	1999–2010	2015	1990–1997	2001
הוגה השיטה	Clyde, M. & Lee, H. (building on Rubin's Bayesian bootstrap, 1981)	Ridgeway, G.; Chipman, H. A. et al.	Taddy, M. et al.	Schapire, R. E.; Freund, Y.	Breiman, L.
סוג	Ensemble (Bayesian bootstrap aggregation)	Probabilistic ensemble (Bayesian interpretation of boosting)	Bayesian ensemble of decision trees	Sequential ensemble (iterative reweighting)	Ensemble (bagging of decision trees)
מקור מכונן	Clyde, M. & Lee, H. (2001). Bagging and the Bayesian bootstrap. In T. Richardson & T. Jaakkola (Eds.), Proceedings of the Eighth International Workshop on Artificial Intelligence and Statistics (AISTATS 2001).	Ridgeway, G. (1999). The state of boosting. Computing Science and Statistics, 31, 172–181.	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.	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.
כינויים	Bayesian bootstrap aggregation, BB-ensemble, Bayesian model averaging via bootstrap, Bayesian bagged ensemble	Bayesian ensemble boosting, probabilistic boosting, Bayesian additive model, Bayesian boosted ensemble	Bayesian Forest, BRF, Empirical Bayesian Forest, posterior random forest	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
קשורות	6	5	5	6	4
תקציר	Bayesian Bagging replaces the classical bootstrap with the Bayesian bootstrap — drawing Dirichlet-distributed weights over training observations rather than sampling with replacement — and trains an ensemble of base learners under those weights. The result is a principled ensemble that approximates a Bayesian posterior over predictions, yielding calibrated uncertainty estimates alongside strong predictive accuracy.	Bayesian boosting integrates probabilistic Bayesian inference with boosting ensemble techniques, combining multiple weak learners while maintaining full uncertainty quantification over predictions. Unlike standard gradient boosting that produces a single point estimate, Bayesian boosting yields a posterior distribution over the ensemble output, enabling calibrated confidence intervals alongside predictions.	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.	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.