השוואת שיטות

	בוסטינג בייסיאני	בוסטינג
תחום	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning
שנת המקור	1999–2010	1990–1997
הוגה השיטה	Ridgeway, G.; Chipman, H. A. et al.	Schapire, R. E.; Freund, Y.
סוג	Probabilistic ensemble (Bayesian interpretation of boosting)	Sequential ensemble (iterative reweighting)
מקור מכונן	Ridgeway, G. (1999). The state of boosting. Computing Science and Statistics, 31, 172–181.	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 ensemble boosting, probabilistic boosting, Bayesian additive model, Bayesian boosted ensemble	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble
קשורות	5	6
תקציר	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.	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.