השוואת שיטות

	Bagging Ensemble	יער אקראי	XGBoost
תחום	למידת אנסמבל	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning	Machine learning
שנת המקור	1996	2001	2016
הוגה השיטה	Leo Breiman	Breiman, L.	Chen, T. & Guestrin, C.
סוג	parallel ensemble	Ensemble (bagging of decision trees)	Ensemble (gradient-boosted decision trees)
מקור מכונן	Breiman, L. (1996). Bagging predictors. Machine Learning, 24(2), 123-140.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.	Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794.
כינויים	bootstrap aggregating	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble	XGBoost, extreme gradient boosting, scalable tree boosting
קשורות	4	4	5
תקציר	Bagging, short for bootstrap aggregating, is an ensemble method that reduces variance by training multiple copies of a single learning algorithm on different random subsets of the training data. Each subset is created via bootstrap sampling—randomly drawing samples with replacement. Predictions are combined through majority voting (classification) or averaging (regression). Introduced by Leo Breiman in 1996, bagging forms the foundation for random forests and is particularly effective for reducing overfitting in high-variance models.	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.	XGBoost (Extreme Gradient Boosting) is a scalable tree-boosting algorithm introduced by Tianqi Chen and Carlos Guestrin in 2016. It builds a strong predictor by adding decision trees one at a time, each correcting the errors left by the trees before it, and is a powerful prediction method widely used in competitions.