Minimal-unsatisfiable-core-driven Local Explainability Analysis for Random Forest
File version
Author(s)
Shi, JQ
Huang, YH
Qin, SC
Hou, Z
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
Size
File type(s)
Location
License
Abstract
With the broader adoption of machine learning (ML) in security-critical fields, the requirements for the explainability of ML are also increasing. The explainability aims at helping people understand models’ internal working principles and decision basis, which adds their realibility. However, the research on understanding ML models, such as random forest (RF), is still in the infant stage. Considering the strict and standardized characteristics of formal methods and their wide application in the field of ML in recent years, this work leverages formal methods and logical reasoning to develop a machine learning interpretability method for explaining the prediction of RF. Specifically, the decision-making process of RF is encoded into first-order logic formula, and the proposed approach is centered around minimal unsatisfiable cores (MUC) and local interpretation of feature importance and counterfactual sample generation method are provided. Experimental results on several public datasets illustrate the high quality of the proposed feature importance measurement, and the counterfactual sample generation method outperforms the state-of-the-art method. Moreover, from the perspective of user friendliness, the user report can be generated according to the analysis results of counterfactual samples, which can provide suggestions for users to improve their own situation in real-life applications.
Journal Title
Journal of Software (软件学报)
Conference Title
Book Title
Edition
Volume
33
Issue
7
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
English abstract page: https://jos.org.cn/josen/article/abstract/6586?st=article_issue
Access the data
Related item(s)
Subject
Artificial intelligence
Persistent link to this record
Citation
Ma, SC; Shi, JQ; Huang, YH; Qin, SC; Hou, Z, Minimal-unsatisfiable-core-driven Local Explainability Analysis for Random Forest, Journal of Software (软件学报), 2022, 33 (7), pp. 2447-2463