ScholarGate
アシスタント

手法を比較

選択した手法を並べて確認できます。異なる行はハイライト表示されます。

説明可能なLightGBM×ランダムフォレスト×
分野機械学習機械学習
系統Machine learningMachine learning
提唱年20172001
提唱者Ke, G. et al. (LightGBM); Lundberg, S. M. & Lee, S.-I. (SHAP for tree models)Breiman, L.
種類Gradient boosting with post-hoc explainability (SHAP)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 ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
別名XAI-LightGBM, LightGBM with SHAP, Interpretable LightGBM, LightGBM explainabilityRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
関連64
概要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.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. 2 出典
  3. PUBLISHED

検索へ スライドをダウンロード

ScholarGate手法を比較: Explainable LightGBM · Random Forest. 2026-06-17に以下より取得 https://scholargate.app/ja/compare