방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 설명 가능한 투표 앙상블× | 배깅 (Bootstrap Aggregating)× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2016–2020 | 1996 |
| 창시자≠ | Composite: voting ensemble (Dietterich, 2000) + XAI frameworks (Ribeiro et al., 2016; Lundberg & Lee, 2017) | Breiman, L. |
| 유형≠ | Ensemble with post-hoc or ante-hoc interpretability | Ensemble meta-algorithm (variance reduction via bootstrap aggregation) |
| 원전≠ | 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. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. DOI ↗ |
| 별칭≠ | XAI voting ensemble, interpretable voting classifier, transparent voting ensemble, explainable majority vote model | Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor |
| 관련≠ | 6 | 5 |
| 요약≠ | An Explainable Voting Ensemble combines predictions from multiple diverse base models through majority vote (hard voting) or averaged probabilities (soft voting), then applies post-hoc or ante-hoc XAI techniques — such as SHAP values, LIME, or permutation importance — to produce feature-level explanations for the combined model's decisions. The goal is to retain the accuracy gains of ensemble aggregation while meeting interpretability requirements in high-stakes or regulated applications. | Bagging, short for Bootstrap Aggregating, is an ensemble meta-algorithm introduced by Leo Breiman in 1996 that trains multiple copies of a base learner on independently drawn bootstrap samples of the training data and combines their predictions — by averaging for regression or majority vote for classification — to produce a final predictor with substantially lower variance than any single base learner. |
| ScholarGate데이터셋 ↗ |
|
|