השוואת שיטות

	יער אקראי בייסיאני	בוסטינג
תחום	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning
שנת המקור	2015	1990–1997
הוגה השיטה	Taddy, M. et al.	Schapire, R. E.; Freund, Y.
סוג	Bayesian ensemble of decision trees	Sequential ensemble (iterative reweighting)
מקור מכונן	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.
כינויים	Bayesian Forest, BRF, Empirical Bayesian Forest, posterior random forest	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble
קשורות	5	6
תקציר	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.