Efficient Learning of Interpretable Classification Rules
From MaRDI portal
Publication:5043563
DOI10.1613/JAIR.1.13482OpenAlexW4293686325MaRDI QIDQ5043563FDOQ5043563
Authors: Bishwamittra Ghosh, Dmitry M. Malioutov, Kuldeep S. Meel
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
Recommendations
Cites Work
- PBLib -- a library for encoding pseudo-Boolean constraints into CNF
- DeepRED
- Learning certifiably optimal rule lists for categorical data
- A Bayesian framework for learning rule sets for interpretable classification
- Interpretable classifiers using rules and Bayesian analysis: building a better stroke prediction model
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Title not available (Why is that?)
- Separate-and-conquer rule learning
- Open-WBO: a modular MaxSAT solver
- The first and second Max-SAT evaluations
- A SAT-based approach to learn explainable decision sets
- Title not available (Why is that?)
- MLIC
- Rule extraction from support vector machines: an overview of issues and application in credit scoring
- Learning Optimal Decision Sets and Lists with SAT
- Definitions, methods, and applications in interpretable machine learning
- SAT-based encodings for optimal decision trees with explicit paths
- Rule extraction from support vector machines: an introduction
Cited In (3)
Uses Software
This page was built for publication: Efficient Learning of Interpretable Classification Rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5043563)