Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| LightGBM Explicabil× | CatBoost× | Gradient Boosting× | |
|---|---|---|---|
| Domeniu | Învățare automată | Învățare automată | Învățare automată |
| Familie | Machine learning | Machine learning | Machine learning |
| Anul apariției≠ | 2017 | 2018 | 2001 |
| Autorul original≠ | Ke, G. et al. (LightGBM); Lundberg, S. M. & Lee, S.-I. (SHAP for tree models) | Prokhorenkova, L. et al. (Yandex) | Friedman, J. H. |
| Tip≠ | Gradient boosting with post-hoc explainability (SHAP) | Gradient boosting on decision trees | Ensemble (sequential boosting of decision trees) |
| Sursa seminală≠ | Lundberg, S. M., & Lee, S.-I. (2017). A unified approach to interpreting model predictions. Advances in Neural Information Processing Systems, 30, 4765–4774. link ↗ | Prokhorenkova, L., Gusev, G., Vorobev, A., Dorogush, A.V. & Gulin, A. (2018). CatBoost: Unbiased Boosting with Categorical Features. In NeurIPS 2018. DOI ↗ | Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗ |
| Denumiri alternative | XAI-LightGBM, LightGBM with SHAP, Interpretable LightGBM, LightGBM explainability | CatBoost (Categorical Boosting), categorical boosting, ordered boosting, kategorik gradyan artırma | Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine |
| Înrudite≠ | 6 | 5 | 5 |
| Rezumat≠ | Explainable LightGBM combines Microsoft's LightGBM gradient boosting framework with SHAP (SHapley Additive exPlanations) to deliver both high predictive performance and rigorous, theoretically grounded feature-level explanations. It is widely adopted in applied research where predictive accuracy and interpretability are simultaneously required. | 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. | 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. |
| ScholarGateSet de date ↗ |
|
|
|