ScholarGate
アシスタント

手法を比較

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

説明可能なLightGBM×CatBoost×決定木×
分野機械学習機械学習機械学習
系統Machine learningMachine learningMachine learning
提唱年201720181984
提唱者Ke, G. et al. (LightGBM); Lundberg, S. M. & Lee, S.-I. (SHAP for tree models)Prokhorenkova, L. et al. (Yandex)Breiman, Friedman, Olshen & Stone
種類Gradient boosting with post-hoc explainability (SHAP)Gradient boosting on decision treesRecursive partitioning (if-then rules)
原典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., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗
別名XAI-LightGBM, LightGBM with SHAP, Interpretable LightGBM, LightGBM explainabilityCatBoost (Categorical Boosting), categorical boosting, ordered boosting, kategorik gradyan artırmaKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree
関連655
概要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.A Decision Tree is an interpretable classification and regression method, formalised by Breiman, Friedman, Olshen and Stone in their 1984 CART framework, that partitions the data with hierarchical if-then rules. Each split sends observations down one branch or another until a prediction is read off the leaf.
ScholarGateデータセット
  1. v1
  2. 2 出典
  3. PUBLISHED
  1. v1
  2. 1 出典
  3. PUBLISHED
  1. v1
  2. 1 出典
  3. PUBLISHED

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

ScholarGate手法を比較: Explainable LightGBM · CatBoost · Decision Tree. 2026-06-18に以下より取得 https://scholargate.app/ja/compare