方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 反事实解释× | 随机森林× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2017 | 2001 |
| 提出者≠ | Sandra Wachter, Brent Mittelstadt & Chris Russell | Breiman, L. |
| 类型≠ | Post-hoc, model-agnostic explanation | Ensemble (bagging of decision trees) |
| 开创性文献≠ | Wachter, S., Mittelstadt, B., & Russell, C. (2017). Counterfactual explanations without opening the black box: Automated decisions and the GDPR. Harvard Journal of Law & Technology, 31, 841–887. link ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| 别名 | Algorithmic Recourse, Contrastive Explanations, What-If Explanations, Karşıolgusal Açıklamalar | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| 相关≠ | 2 | 4 |
| 摘要≠ | Counterfactual explanations, introduced by Wachter, Mittelstadt, and Russell in 2017, answer the question: 'What is the smallest change to the input that would have produced a different model output?' Rather than explaining why a model made a decision, they describe what would need to change for that decision to be reversed, making them particularly valuable for high-stakes applications such as credit scoring, medical diagnosis, and hiring decisions under frameworks like the EU GDPR. | 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. |
| ScholarGate数据集 ↗ |
|
|