方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 可解释关联规则× | 可解释随机森林× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1993 (rules); 2010s (XAI framing) | 2001–2017 |
| 提出者≠ | Agrawal, R., Imielinski, T., & Swami, A. (foundational); XAI framing: broader community (2010s–present) | Breiman, L. (RF); Lundberg & Lee (SHAP attribution) |
| 类型≠ | Interpretable pattern mining / XAI technique | Interpretable ensemble (bagging + post-hoc attribution) |
| 开创性文献≠ | Agrawal, R., Imielinski, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, 207–216. DOI ↗ | Lundberg, S. M., & Lee, S.-I. (2017). A unified approach to interpreting model predictions. Advances in Neural Information Processing Systems, 30, 4765–4774. link ↗ |
| 别名 | XAI association rules, interpretable association rules, rule-based explanation mining, transparent association rule learning | XRF, interpretable random forest, transparent random forest, random forest with explainability |
| 相关≠ | 6 | 4 |
| 摘要≠ | Explainable Association Rules leverages the inherently symbolic, if-then structure of association rule mining to provide human-readable explanations of data patterns or black-box model decisions. Because each rule explicitly states its antecedent and consequent together with support, confidence, and lift, the outputs are natively interpretable without requiring a secondary post-hoc surrogate. | Explainable Random Forest (XRF) combines the predictive power of Breiman's Random Forest ensemble with systematic post-hoc attribution methods — principally SHAP values and mean-decrease-in-impurity importance — to make model decisions transparent and auditable. It delivers both high accuracy and human-interpretable feature contributions, satisfying demands from regulators, domain experts, and academic reviewers alike. |
| ScholarGate数据集 ↗ |
|
|