השוואת שיטות

	בוסטינג בייסיאני	יער אקראי
תחום	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning
שנת המקור	1999–2010	2001
הוגה השיטה	Ridgeway, G.; Chipman, H. A. et al.	Breiman, L.
סוג	Probabilistic ensemble (Bayesian interpretation of boosting)	Ensemble (bagging of decision trees)
מקור מכונן	Ridgeway, G. (1999). The state of boosting. Computing Science and Statistics, 31, 172–181.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
כינויים	Bayesian ensemble boosting, probabilistic boosting, Bayesian additive model, Bayesian boosted ensemble	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
קשורות	5	4
תקציר	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.	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.