On Tackling Explanation Redundancy in Decision Trees

Cites Work

LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation
Title not available (Why is that?)
PySAT: a Python toolkit for prototyping with SAT oracles
Title not available (Why is that?)
Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing
Artificial Intelligence
Title not available (Why is that?)
Statistical modeling: The two cultures. (With comments and a rejoinder).
Pattern classification.
The vectorization of ITPACK 2C
Title not available (Why is that?)
Understanding Machine Learning
Minimal sets on propositional formulae. Problems and reductions
Algorithms for computing minimal unsatisfiable subsets of constraints
Consistent subsets of inconsistent systems: structure and behaviour
Title not available (Why is that?)
The complexity of theorem-proving procedures
A theory of diagnosis from first principles
Fast, flexible MUS enumeration
Towards efficient MUS extraction
On the Complexity of Dualization of Monotone Disjunctive Normal Forms
On the complexity of the maximum satisfiability problem for Horn formulas
Identifying the Minimal Transversals of a Hypergraph and Related Problems
Multivariate decision trees
Constructing optimal binary decision trees is NP-complete
Title not available (Why is that?)
Machine learning. The art and science of algorithms that make sense of data.
Data Mining with Decision Trees
Network Coding for Computing: Cut-Set Bounds
Guide to intelligent data analysis. How to intelligently make sense of real data
Top-down induction of first-order logical decision trees
Prime Implicates and Prime Implicants: From Propositional to Modal Logic
An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
Title not available (Why is that?)
Decision tree induction based on efficient tree restructuring
Title not available (Why is that?)
An Efficient Algorithm for the Transversal Hypergraph Generation
Explanation in artificial intelligence: insights from the social sciences
A SAT-based approach to learn explainable decision sets
Optimal classification trees
Learning optimal decision trees using constraint programming
Learning decision trees with flexible constraints and objectives using integer optimization
Assessing heuristic machine learning explanations with model counting
Title not available (Why is that?)
Efficient Reasoning for Inconsistent Horn Formulae
The Computational Complexity of Understanding Binary Classifier Decisions
Title not available (Why is that?)
The Top Ten Algorithms in Data Mining
MCS Extraction with Sublinear Oracle Queries
SAT-based rigorous explanations for decision lists
A logic for binary classifiers and their explanation
The voice of optimization
Explainable Deep Learning: A Field Guide for the Uninitiated
SAT-based encodings for optimal decision trees with explicit paths
Argumentative explanations for interactive recommendations
Title not available (Why is that?)
Machine Learning
On Quantifying Literals in Boolean Logic and its Applications to Explainable AI
Principles of data mining

Cited In (10)

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
How to find a good explanation for clustering?
Title not available (Why is that?)
On the (complete) reasons behind decisions
Feature necessity \& relevancy in ML classifier explanations
A new class of explanations for classifiers with non-binary features

Uses Software

UCI-ml
JBool
Scikit
Ltur
C4.5
PySAT
PMLB
AIspace
PyDL8.5
ITI
MediBoost

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)