方法对比

	可解释 LightGBM	决策树	随机森林
领域	机器学习	机器学习	机器学习
方法族	Machine learning	Machine learning	Machine learning
起源年份	2017	1984	2001
提出者	Ke, G. et al. (LightGBM); Lundberg, S. M. & Lee, S.-I. (SHAP for tree models)	Breiman, Friedman, Olshen & Stone	Breiman, L.
类型	Gradient boosting with post-hoc explainability (SHAP)	Recursive partitioning (if-then rules)	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.	Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
别名	XAI-LightGBM, LightGBM with SHAP, Interpretable LightGBM, LightGBM explainability	Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
相关	6	5	4
摘要	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.	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.