قارن الطرق
راجع الطرق التي اخترتها جنبًا إلى جنب؛ الصفوف المختلفة مميَّزة.
| تعزيز التدرج× | تطبيق LightGBM المُنتظم (Regularized LightGBM)× | |
|---|---|---|
| المجال | تعلم الآلة | تعلم الآلة |
| العائلة | Machine learning | Machine learning |
| سنة النشأة≠ | 2001 | 2017 |
| صاحب الطريقة≠ | Friedman, J. H. | Ke, G. et al. (Microsoft Research) |
| النوع≠ | Ensemble (sequential boosting of decision trees) | Regularized gradient boosting ensemble |
| المصدر التأسيسي≠ | Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. 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, 30, 3146–3154. link ↗ |
| الأسماء البديلة | Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine | LightGBM with L1/L2 regularization, penalized LightGBM, LightGBM ridge/lasso, regularized LGBM |
| ذات صلة | 5 | 5 |
| الملخص≠ | 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. | Regularized LightGBM applies L1 (lasso) and L2 (ridge) penalty terms to the leaf weight objective of LightGBM — Microsoft's highly efficient gradient boosting framework — to control model complexity, reduce overfitting, and improve generalization on tabular classification and regression tasks with high-dimensional or noisy feature sets. |
| ScholarGateمجموعة البيانات ↗ |
|
|