Counterfactual Explanations for Concepts in $\mathcal{ELH}$
| Autor: | Sieger, Leonie Nora, Heindorf, Stefan, Blübaum, Lukas, Ngomo, Axel-Cyrille Ngonga |
|---|---|
| Rok vydání: | 2023 |
| Předmět: | |
| DOI: | 10.48550/arxiv.2301.05109 |
| Popis: | Knowledge bases are widely used for information management on the web, enabling high-impact applications such as web search, question answering, and natural language processing. They also serve as the backbone for automatic decision systems, e.g. for medical diagnostics and credit scoring. As stakeholders affected by these decisions would like to understand their situation and verify fair decisions, a number of explanation approaches have been proposed using concepts in description logics. However, the learned concepts can become long and difficult to fathom for non-experts, even when verbalized. Moreover, long concepts do not immediately provide a clear path of action to change one's situation. Counterfactuals answering the question "How must feature values be changed to obtain a different classification?" have been proposed as short, human-friendly explanations for tabular data. In this paper, we transfer the notion of counterfactuals to description logics and propose the first algorithm for generating counterfactual explanations in the description logic $\mathcal{ELH}$. Counterfactual candidates are generated from concepts and the candidates with fewest feature changes are selected as counterfactuals. In case of multiple counterfactuals, we rank them according to the likeliness of their feature combinations. For evaluation, we conduct a user survey to investigate which of the generated counterfactual candidates are preferred for explanation by participants. In a second study, we explore possible use cases for counterfactual explanations. Comment: Submitted to WWW23 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|