方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 可解释 LightGBM× | 决策树× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2017 | 1984 |
| 提出者≠ | Ke, G. et al. (LightGBM); Lundberg, S. M. & Lee, S.-I. (SHAP for tree models) | Breiman, Friedman, Olshen & Stone |
| 类型≠ | Gradient boosting with post-hoc explainability (SHAP) | Recursive 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 ↗ | 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 explainability | Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree |
| 相关≠ | 6 | 5 |
| 摘要≠ | 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. | 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数据集 ↗ |
|
|