So sánh phương pháp

	Luật kết hợp có thể giải thích	Rừng ngẫu nhiên có thể giải thích
Lĩnh vực	Học máy	Học máy
Họ	Machine learning	Machine learning
Năm ra đời	1993 (rules); 2010s (XAI framing)	2001–2017
Người khởi xướng	Agrawal, R., Imielinski, T., & Swami, A. (foundational); XAI framing: broader community (2010s–present)	Breiman, L. (RF); Lundberg & Lee (SHAP attribution)
Loại	Interpretable pattern mining / XAI technique	Interpretable ensemble (bagging + post-hoc attribution)
Công trình gốc	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.	Lundberg, S. M., & Lee, S.-I. (2017). A unified approach to interpreting model predictions. Advances in Neural Information Processing Systems, 30, 4765–4774.
Tên gọi khác	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
Liên quan	6	4
Tóm tắt	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.