قارن الطرق

	XGBoost	تعزيز التدرج	الانحدار اللوجستي	الغابات العشوائية
المجال	تعلم الآلة	تعلم الآلة	إحصاء البحث	تعلم الآلة
العائلة	Machine learning	Machine learning	Process / pipeline	Machine learning
سنة النشأة	2016	2001	1958	2001
صاحب الطريقة	Chen, T. & Guestrin, C.	Friedman, J. H.	David Roxbee Cox	Breiman, L.
النوع	Ensemble (gradient-boosted decision trees)	Ensemble (sequential boosting of decision trees)	Method	Ensemble (bagging of decision trees)
المصدر التأسيسي	Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794.	Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232.	Cox, D. R. (1958). The regression analysis of binary sequences. Journal of the Royal Statistical Society, Series B, 20(2), 215–242.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
الأسماء البديلة	XGBoost, extreme gradient boosting, scalable tree boosting	Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine	logit model, binomial logistic regression, LR	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
ذات صلة	5	5	3	4
الملخص	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.	Gradient Boosting is an ensemble learning method, formalised by Jerome H. Friedman in 2001, that combines a sequence of weak learners — typically shallow decision trees — so that each new tree is fitted to minimise the residual errors of the trees before it. It is the core algorithm behind popular implementations such as XGBoost, LightGBM and CatBoost.	Logistic regression is a statistical method for modeling the probability of a binary outcome (disease present/absent, success/failure) as a function of continuous and categorical predictors. Developed by David Roxbee Cox (1958), it solves the problem of predicting categorical outcomes by applying a logistic transformation to constrain predictions to the [0,1] probability interval, enabling accurate risk stratification, diagnostic prediction, and causal inference in epidemiology, medicine, and social science.	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.