On Tackling Explanation Redundancy in Decision Trees

DOI10.1613/jair.1.13575OpenAlexW4298091860MaRDI QIDQ5041018

Alexey Ignatiev, Yacine Izza, João P. Marques-Silva

Publication date: 18 October 2022

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.09971

zbMATH Keywords

automated reasoningdecision treessatisfiabilityconstraint programming

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Related Items (3)

On computing probabilistic abductive explanations ⋮ On the (complete) reasons behind decisions ⋮ How to find a good explanation for clustering?

Uses Software

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

Cites Work

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

This page was built for publication: On Tackling Explanation Redundancy in Decision Trees