On Tackling Explanation Redundancy in Decision Trees
From MaRDI portal
(Redirected from Publication:5041018)
Recommendations
- A SAT-based approach to learn explainable decision sets
- Regularized impurity reduction: accurate decision trees with complexity guarantees
- Feature necessity \& relevancy in ML classifier explanations
- Learning Optimal Decision Sets and Lists with SAT
- How to explain individual classification decisions
Cites work
- scientific article; zbMATH DE number 1651999 (Why is no real title available?)
- scientific article; zbMATH DE number 5852793 (Why is no real title available?)
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 500950 (Why is no real title available?)
- scientific article; zbMATH DE number 1179314 (Why is no real title available?)
- scientific article; zbMATH DE number 835699 (Why is no real title available?)
- scientific article; zbMATH DE number 7625179 (Why is no real title available?)
- scientific article; zbMATH DE number 6317138 (Why is no real title available?)
- scientific article; zbMATH DE number 5032602 (Why is no real title available?)
- A SAT-based approach to learn explainable decision sets
- A logic for binary classifiers and their explanation
- A theory of diagnosis from first principles
- Algorithms for computing minimal unsatisfiable subsets of constraints
- An Efficient Algorithm for the Transversal Hypergraph Generation
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
- Argumentative explanations for interactive recommendations
- Artificial intelligence. Foundations of computational agents.
- Assessing heuristic machine learning explanations with model counting
- Consistent subsets of inconsistent systems: structure and behaviour
- Constructing optimal binary decision trees is NP-complete
- Data Mining with Decision Trees
- Decision tree induction based on efficient tree restructuring
- Efficient MUS enumeration of Horn formulae with applications to axiom pinpointing
- Efficient reasoning for inconsistent Horn formulae
- Explainable deep learning: a field guide for the uninitiated
- Explanation in artificial intelligence: insights from the social sciences
- Fast, flexible MUS enumeration
- Guide to intelligent data analysis. How to intelligently make sense of real data
- Handbook of satisfiability. In 2 parts
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation
- Learning decision trees with flexible constraints and objectives using integer optimization
- Learning optimal decision trees using constraint programming
- MCS Extraction with Sublinear Oracle Queries
- Machine learning
- Machine learning. The art and science of algorithms that make sense of data.
- Minimal sets on propositional formulae. Problems and reductions
- Multivariate decision trees
- Network Coding for Computing: Cut-Set Bounds
- On quantifying literals in Boolean logic and its applications to explainable AI
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- On the complexity of the maximum satisfiability problem for Horn formulas
- Optimal classification trees
- Pattern classification.
- Prime implicates and prime implicants: from propositional to modal logic
- Principles of data mining
- PySAT: a Python toolkit for prototyping with SAT oracles
- SAT-based encodings for optimal decision trees with explicit paths
- SAT-based rigorous explanations for decision lists
- Scikit-learn: machine learning in Python
- Statistical modeling: The two cultures. (With comments and a rejoinder).
- The Top Ten Algorithms in Data Mining
- The complexity of theorem-proving procedures
- The computational complexity of understanding binary classifier decisions
- The vectorization of ITPACK 2C
- The voice of optimization
- Top-down induction of first-order logical decision trees
- Towards efficient MUS extraction
- Understanding machine learning. From theory to algorithms
Cited in
(15)- On computing probabilistic abductive explanations
- On the failings of Shapley values for explainability
- Synergies between machine learning and reasoning -- an introduction by the Kay R. Amel group
- Towards formal XAI: formally approximate minimal explanations of neural networks
- Consolidated trees versus bagging when explanation is required
- Feature necessity and relevancy in machine learning explanations
- Evolving interpretable decision trees for reinforcement learning
- How to find a good explanation for clustering?
- scientific article; zbMATH DE number 1149435 (Why is no real title available?)
- Formal explanations of black-box ranking functions
- Common abductive explanations in first order logic
- On computing probabilistic explanations for decision trees
- On the (complete) reasons behind decisions
- Feature necessity \& relevancy in ML classifier explanations
- A new class of explanations for classifiers with non-binary features
Describes a project that uses
Uses Software
This page was built for publication: On Tackling Explanation Redundancy in Decision Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041018)
