השוואת שיטות

	בוסטינג בייסיאני	יער אקראי בייסיאני
תחום	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning
שנת המקור	1999–2010	2015
הוגה השיטה	Ridgeway, G.; Chipman, H. A. et al.	Taddy, M. et al.
סוג	Probabilistic ensemble (Bayesian interpretation of boosting)	Bayesian ensemble of decision trees
מקור מכונן	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.
כינויים	Bayesian ensemble boosting, probabilistic boosting, Bayesian additive model, Bayesian boosted ensemble	Bayesian Forest, BRF, Empirical Bayesian Forest, posterior random forest
קשורות	5	5
תקציר	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.