about
An Ontology-Based Approach to Explaining Artificial Neural Networks (arxiv.org)
6 points by sel1 on Jun 21, 2019 | hide | past | pdf | discuss on HN

In plain words: A tool that explains a neural network's decisions by growing a decision tree folds in a map of domain facts, so its rules use domain terms. In finance and medicine tests, people understood these trees better and answered more accurately than trees built without it.

Abstract · Trepan Reloaded: A Knowledge-driven Approach to Explaining Artificial Neural Networks

Explainability in Artificial Intelligence has been revived as a topic of active research by the need of conveying safety and trust to users in the `how' and `why' of automated decision-making. Whilst a plethora of approaches have been developed for post-hoc explainability, only a few focus on how to use domain knowledge, and how this influences the understandability of global explanations from the users' perspective. In this paper, we show how ontologies help the understandability of global post-hoc explanations, presented in the form of symbolic models. In particular, we build on Trepan, an algorithm that explains artificial neural networks by means of decision trees, and we extend it to include ontologies modeling domain knowledge in the process of generating explanations. We present the results of a user study that measures the understandability of decision trees using a syntactic complexity measure, and through time and accuracy of responses as well as reported user confidence and understandability. The user study considers domains where explanations are critical, namely, in finance and medicine. The results show that decision trees generated with our algorithm, taking into account domain knowledge, are more understandable than those generated by standard Trepan without the use of ontologies.

Roberto Confalonieri, Tillman Weyde, Tarek R. Besold, Fermín Moscoso del Prado Martín
arXiv:1906.08362 · cs.AI · submitted Jun 19, 2019 · updated Nov 21, 2019
abstract · pdf · html

add comment on HN