Key points are not available for this paper at this time.
After building a classifier with modern tools of machine learning we typically have a black box at hand that is able to predict well for unseen data. Thus, we get an answer to the question what is the most likely label of a given unseen data point. However, most methods will provide no answer why the model predicted the particular label for a single instance and what features were most influential for that particular instance. The only method that is currently able to provide such explanations are decision trees. This paper proposes a procedure which (based on a set of assumptions) allows to explain the decisions of any classification method.
Building similarity graph...
Analyzing shared references across papers
Loading...
David Baehrens
Timon Schroeter
Stefan Harmeling
Max Planck Society
Technische Universität Berlin
Max Planck Institute for Biological Cybernetics
Building similarity graph...
Analyzing shared references across papers
Loading...
Baehrens et al. (Sun,) studied this question.
www.synapsesocial.com/papers/69d995845e5bcb4e3b837191 — DOI: https://doi.org/10.48550/arxiv.0912.1128