So sánh phương pháp
Xem các phương pháp đã chọn cạnh nhau; những hàng khác biệt được làm nổi bật.
| LightGBM Có Thể Giải Thích× | Rừng ngẫu nhiên× | |
|---|---|---|
| Lĩnh vực | Học máy | Học máy |
| Họ | Machine learning | Machine learning |
| Năm ra đời≠ | 2017 | 2001 |
| Người khởi xướng≠ | Ke, G. et al. (LightGBM); Lundberg, S. M. & Lee, S.-I. (SHAP for tree models) | Breiman, L. |
| Loại≠ | Gradient boosting with post-hoc explainability (SHAP) | Ensemble (bagging of decision trees) |
| Công trình gốc≠ | 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 ↗ |
| Tên gọi khác | XAI-LightGBM, LightGBM with SHAP, Interpretable LightGBM, LightGBM explainability | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Liên quan≠ | 6 | 4 |
| Tóm tắt≠ | 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. |
| ScholarGateBộ dữ liệu ↗ |
|
|