قارن الطرق
راجع الطرق التي اخترتها جنبًا إلى جنب؛ الصفوف المختلفة مميَّزة.
| تعزيز التدرج (Gradient Boosting)× | CatBoost× | لايت جي بي إم× | |
|---|---|---|---|
| المجال | تعلم الآلة | تعلم الآلة | تعلم الآلة |
| العائلة | Machine learning | Machine learning | Machine learning |
| سنة النشأة≠ | 2001 | 2018 | 2017 |
| صاحب الطريقة≠ | Friedman, J. H. | Prokhorenkova, L. et al. (Yandex) | Ke, G. et al. (Microsoft) |
| النوع≠ | Ensemble (sequential boosting of decision trees) | Gradient boosting on decision trees | Gradient boosting decision tree ensemble |
| المصدر التأسيسي≠ | Friedman, J. H. (2001). Greedy function approximation: A gradient boosting machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗ | Prokhorenkova, L., Gusev, G., Vorobev, A., Dorogush, A.V. & Gulin, A. (2018). CatBoost: Unbiased Boosting with Categorical Features. In NeurIPS 2018. DOI ↗ | Ke, G., Meng, Q., Finley, T., Wang, T., Chen, W., Ma, W., Ye, Q. & Liu, T.-Y. (2017). LightGBM: A Highly Efficient Gradient Boosting Decision Tree. Advances in Neural Information Processing Systems (NeurIPS) 30, 3146–3154. link ↗ |
| الأسماء البديلة | Gradient Boosting Machine, GBM, Gradient Tree Boosting, Stochastic Gradient Boosting | CatBoost (Categorical Boosting), categorical boosting, ordered boosting, kategorik gradyan artırma | LightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boosting |
| ذات صلة≠ | 6 | 5 | 5 |
| الملخص≠ | Gradient Boosting is an ensemble method introduced by Jerome Friedman in 2001 that builds a strong predictive model by sequentially adding shallow decision trees, each correcting the errors of the previous ensemble. By framing the problem as gradient descent in function space, it achieves state-of-the-art accuracy on classification, regression, and ranking tasks across tabular data. | CatBoost is a gradient boosting algorithm, introduced by Prokhorenkova and colleagues at Yandex in 2018, that handles categorical variables natively and uses ordered target encoding to avoid label leakage. By building an additive ensemble of trees while permuting the data order at each iteration, it is often superior to XGBoost and LightGBM on category-heavy data. | LightGBM is Microsoft's gradient boosting decision tree implementation, introduced by Ke and colleagues in 2017, that grows trees leaf-wise and bins features into histograms for speed. On large datasets it is much faster than XGBoost while retaining strong predictive accuracy. |
| ScholarGateمجموعة البيانات ↗ |
|
|
|