Efficient Learning of Interpretable Classification Rules
From MaRDI portal
Publication:5043563
DOI10.1613/jair.1.13482OpenAlexW4293686325MaRDI QIDQ5043563
Kuldeep S. Meel, Dmitry M. Malioutov, Bishwamittra Ghosh
Publication date: 6 October 2022
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.06936
Related Items (1)
Uses Software
Cites Work
- Learning Certifiably Optimal Rule Lists for Categorical Data
- DeepRED
- Interpretable classifiers using rules and Bayesian analysis: building a better stroke prediction model
- Separate-and-conquer rule learning
- MLIC
- A SAT-based approach to learn explainable decision sets
- SAT-based encodings for optimal decision trees with explicit paths
- Open-WBO: A Modular MaxSAT Solver,
- PBLib – A Library for Encoding Pseudo-Boolean Constraints into CNF
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Learning Optimal Decision Sets and Lists with SAT
- Definitions, methods, and applications in interpretable machine learning
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Efficient Learning of Interpretable Classification Rules
