LoRMIkA: Local rule-based model interpretability with k associations

被引:18
作者
Rajapaksha, Dilini [1 ]
Bergmeir, Christoph [1 ]
Buntine, Wray [1 ]
机构
[1] Monash Univ, Fac Informat Technol, Melbourne, Vic, Australia
基金
澳大利亚研究理事会;
关键词
Interpretability; Local-interpretability; k-optimal; Class-association-rules; ALGORITHM; CLASSIFICATION; SET;
D O I
10.1016/j.ins.2020.05.126
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
As we rely more and more on machine learning models for real-life decision-making, being able to understand and trust the predictions becomes ever more important. Local explainer models have recently been introduced to explain the predictions of complex machine learning models at the instance level. In this paper, we propose Local Rule-based Model Interpretability with k-optimal Associations (LoRMIkA), a novel model-agnostic approach that obtains k-optimal association rules from a neighbourhood of the instance to be explained. Compared with other rule-based approaches in the literature, we argue that the most predictive rules are not necessarily the rules that provide the best explanations. Consequently, the LoRMIkA framework provides a flexible way to obtain predictive and interesting rules. It uses an efficient search algorithm guaranteed to find the k-optimal rules with respect to objectives such as confidence, lift, leverage, coverage, and support. It also provides multiple rules which explain the decision and counterfactual rules, which give indications for potential changes to obtain different outputs for given instances. We compare our approach to other state-of-the-art approaches in local model interpretability on three different datasets and achieve competitive results in terms of local accuracy and interpretability. (c) 2020 Elsevier Inc. All rights reserved.
引用
收藏
页码:221 / 241
页数:21
相关论文
共 43 条
  • [1] Agrawal R., 1993, SIGMOD Record, V22, P207, DOI 10.1145/170036.170072
  • [2] Arik Sercan Omer, 2019, CORR
  • [3] Interpretable regularized class association rules algorithm for classification in a categorical data space
    Azmi, Mohamed
    Runger, George C.
    Berrado, Abdelaziz
    [J]. INFORMATION SCIENCES, 2019, 483 : 313 - 331
  • [4] Concreteness and abstraction in everyday explanation
    Bechlivanidis, Christos
    Lagnado, David A.
    Zemla, Jeffrey C.
    Sloman, Steven
    [J]. PSYCHONOMIC BULLETIN & REVIEW, 2017, 24 (05) : 1451 - 1464
  • [5] Been Kim, 2018, P 35 INT C MACH LEAR, V35
  • [6] An interpretable classification rule mining algorithm
    Cano, Alberto
    Zafra, Amelia
    Ventura, Sebastian
    [J]. INFORMATION SCIENCES, 2013, 240 : 1 - 20
  • [7] Finding interesting associations without support pruning
    Cohen, E
    Datar, M
    Fujiwara, S
    Gionis, A
    Indyk, P
    Motwani, R
    Ullman, JD
    Yang, C
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2001, 13 (01) : 64 - 78
  • [8] Cohen W.W., 1995, Proceedings of the Twelfth International Conference on Machine Learning, P115, DOI DOI 10.1016/B978-1-55860-377-6.50023-2
  • [9] Dua Dheeru, 2017, UCI Machine Learning Repository
  • [10] Dzeroski S., 1993, Journal of Computing and Information Technology - CIT, V1, P37