Generating explainable rule sets from tree-ensemble learning methods by answer set programming

DOI10.4204/EPTCS.345.26MaRDI QIDQ6647310zbMATH OpenFDO

Authors Akihiro Takemura, Katsumi Inoue

Publication date 3 December 2024

Full work available at URL https://doi.org/10.4204/EPTCS.345.26

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Logic programming (68N17)

Recommendations

• White-box induction from SVM models: explainable AI with logic programming
• Detailed evaluation of fuzzy sets in rule conditions as a key for accurate and explainable rule-based systems
• Learning customized and optimized lists of rules with mathematical programming
• A Bayesian framework for learning rule sets for interpretable classification
• A SAT-based approach to learn explainable decision sets

Cites work

• Greedy function approximation: A gradient boosting machine.
• Hybrid ASP-based approach to pattern mining
• Itemset mining: a constraint programming perspective
• Predictive learning via rule ensembles
• Random forests
• Scikit-learn: machine learning in Python

Cited in

(1)

• FOLD-RM: A Scalable, Efficient, and Explainable Inductive Learning Algorithm for Multi-Category Classification of Mixed Data

This page was built for publication: Generating explainable rule sets from tree-ensemble learning methods by answer set programming

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