ScholarGate
المساعد

قارن الطرق

راجع الطرق التي اخترتها جنبًا إلى جنب؛ الصفوف المختلفة مميَّزة.

LightGBM القابل للتفسير×تعزيز التدرج×الغابات العشوائية×
المجالتعلم الآلةتعلم الآلةتعلم الآلة
العائلةMachine learningMachine learningMachine learning
سنة النشأة201720012001
صاحب الطريقةKe, G. et al. (LightGBM); Lundberg, S. M. & Lee, S.-I. (SHAP for tree models)Friedman, J. H.Breiman, L.
النوعGradient boosting with post-hoc explainability (SHAP)Ensemble (sequential boosting of decision trees)Ensemble (bagging of decision trees)
المصدر التأسيسيLundberg, S. M., & Lee, S.-I. (2017). A unified approach to interpreting model predictions. Advances in Neural Information Processing Systems, 30, 4765–4774. link ↗Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
الأسماء البديلةXAI-LightGBM, LightGBM with SHAP, Interpretable LightGBM, LightGBM explainabilityGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machineRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
ذات صلة654
الملخص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.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.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.
ScholarGateمجموعة البيانات
  1. v1
  2. 2 المصادر
  3. PUBLISHED
  1. v1
  2. 1 المصادر
  3. PUBLISHED
  1. v1
  2. 2 المصادر
  3. PUBLISHED

انتقل إلى البحث تنزيل الشرائح

ScholarGateقارن الطرق: Explainable LightGBM · Gradient Boosting · Random Forest. استُرجع بتاريخ 2026-06-18 من https://scholargate.app/ar/compare