Explaining black-box classifiers: properties and functions
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 4166925 (Why is no real title available?)
- A logic-based theory of deductive arguments
- A mathematical treatment of defeasible reasoning and its implementation.
- A survey on the explainability of supervised machine learning
- Answering the ``why in answer set programming -- a survey of explanation approaches
- Argumentative explanations for interactive recommendations
- Evaluation of argument strength in attack graphs: foundations and semantics
- Explanation in artificial intelligence: insights from the social sciences
- Explanation semantics for abstract argumentation
- Explanation with the winter value: efficient computation for hierarchical Choquet integrals
- Necessary and sufficient explanations for argumentation-based conclusions
- Non-monotonic explanation functions
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- On the reasons behind decisions
- SAT-based rigorous explanations for decision lists
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Theory of capacities
- Using arguments for making and explaining decisions
Cited in
(5)- On the failings of Shapley values for explainability
- Explaining classifiers with measures of statistical association
- Feature necessity and relevancy in machine learning explanations
- Visualizing the Effects of Predictor Variables in Black Box Supervised Learning Models
- A new class of explanations for classifiers with non-binary features
This page was built for publication: Explaining black-box classifiers: properties and functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6099552)
