ScholarGate
دستیار

مقایسهٔ روش‌ها

روش‌های انتخابی خود را کنار هم مرور کنید؛ ردیف‌های متفاوت برجسته شده‌اند.

LightGBM قابل توضیح×CatBoost×جنگل تصادفی×
حوزهیادگیری ماشینیادگیری ماشینیادگیری ماشین
خانوادهMachine learningMachine learningMachine learning
سال پیدایش201720182001
پدیدآورKe, G. et al. (LightGBM); Lundberg, S. M. & Lee, S.-I. (SHAP for tree models)Prokhorenkova, L. et al. (Yandex)Breiman, L.
نوعGradient boosting with post-hoc explainability (SHAP)Gradient boosting on decision treesEnsemble (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 ↗Prokhorenkova, L., Gusev, G., Vorobev, A., Dorogush, A.V. & Gulin, A. (2018). CatBoost: Unbiased Boosting with Categorical Features. In NeurIPS 2018. DOI ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
نام‌های دیگرXAI-LightGBM, LightGBM with SHAP, Interpretable LightGBM, LightGBM explainabilityCatBoost (Categorical Boosting), categorical boosting, ordered boosting, kategorik gradyan artırmaRastgele 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.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.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 · CatBoost · Random Forest. بازیابی‌شده در 2026-06-18 از https://scholargate.app/fa/compare