방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 설명 가능한 그래디언트 부스팅× | 설명 가능한 결정 트리× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2017–2020 | 1984 (CART); XAI framing formalized 2010s–2020s |
| 창시자≠ | Lundberg, S. M. & Lee, S.-I. (TreeSHAP for tree ensembles) | Breiman, L.; Friedman, J.; Olshen, R. A.; Stone, C. J. |
| 유형≠ | Ensemble + explainability layer | Interpretable supervised learning model |
| 원전≠ | Lundberg, S. M., Erion, G., Chen, H., DeGrave, A., Prutkin, J. M., Nair, B., Katz, R., Himmelfarb, J., Bansal, N., & Lee, S.-I. (2020). From local explanations to global understanding with explainable AI for trees. Nature Machine Intelligence, 2, 56–67. DOI ↗ | Breiman, L., Friedman, J., Olshen, R. A., & Stone, C. J. (1984). Classification and Regression Trees. Wadsworth & Brooks/Cole. ISBN: 978-0-412-04841-8 |
| 별칭 | XGB with SHAP, interpretable gradient boosting, transparent gradient boosting, XAI gradient boosting | XDT, interpretable decision tree, rule-based decision tree, transparent decision tree |
| 관련≠ | 6 | 4 |
| 요약≠ | Explainable Gradient Boosting combines the predictive power of gradient boosting ensembles with structured interpretability tools — principally SHAP (SHapley Additive exPlanations) — to produce models that are both highly accurate and transparently auditable. Practitioners obtain global feature rankings and individual-level explanations alongside standard performance metrics. | An Explainable Decision Tree is a classification or regression tree deliberately grown to be shallow, readable, and auditable — producing a finite set of if-then rules that a human can verify without additional tools. It sits at the intersection of predictive modelling and Explainable AI (XAI), chosen when stakeholders must understand and trust every prediction the model makes. |
| ScholarGate데이터셋 ↗ |
|
|