Decision trees with short explainable rules

DOI10.1016/J.TCS.2025.115344MaRDI QIDQ6969925zbMATH OpenFDO

Authors Victor F. C. Souza, Ferdinando Cicalese, Eduardo S. Laber, Marco Molinaro

Publication date 19 June 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115344

zbMATH Keywords

decision treesexplainability measuresinterpretable ML

Mathematics Subject Classification ID

General topics in artificial intelligence (68T01) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites work

• A SAT-based approach to learn explainable decision sets
• A survey on the explainability of supervised machine learning
• A Tight Analysis of Greedy Yields Subexponential Time Approximation for Uniform Decision Tree
• Adaptive submodular ranking and routing
• Average-case active learning with costs
• Complexity measures and decision tree complexity: a survey.
• Decision trees for entity identification, approximation algorithms and hardness results
• Group-Based Active Query Selection for Rapid Diagnosis in Time-Critical Situations
• scientific article; zbMATH DE number 4057247 (Why is no real title available?)
• Lower bounds on learning decision lists and trees
• Mathematics of information and coding. Transl. from the Japanese by Joe Suzuki
• On greedy algorithms for decision trees
• On the hardness of the minimum height decision tree problem
• Optimal classification trees
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis

This page was built for publication: Decision trees with short explainable rules

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