On computing probabilistic explanations for decision trees

DOI10.1613/JAIR.1.17494MaRDI QIDQ6912801zbMATH OpenFDO

Authors Marcelo Arenas, Pablo Barceló, Alexander Kozachinskiy, Miguel Romero, Bernardo Subercaseaux

Publication date 22 October 2025

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1613/JAIR.1.17494

zbMATH Keywords

decision treesmachine learningmathematical foundations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General topics in artificial intelligence (68T01) Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Branching Programs and Binary Decision Diagrams
• Mathematical Foundations of Computer Science 2005
• On Tackling Explanation Redundancy in Decision Trees
• Probability Inequalities for Sums of Bounded Random Variables
• The computational complexity of understanding binary classifier decisions

This page was built for publication: On computing probabilistic explanations for decision trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6912801)