Efficient Learning of Interpretable Classification Rules
From MaRDI portal
Publication:5043563
Recommendations
Cites work
- scientific article; zbMATH DE number 2084780 (Why is no real title available?)
- scientific article; zbMATH DE number 1843053 (Why is no real title available?)
- A Bayesian framework for learning rule sets for interpretable classification
- A SAT-based approach to learn explainable decision sets
- DeepRED
- Definitions, methods, and applications in interpretable machine learning
- Interpretable classifiers using rules and Bayesian analysis: building a better stroke prediction model
- Learning Optimal Decision Sets and Lists with SAT
- Learning certifiably optimal rule lists for categorical data
- MLIC
- Open-WBO: a modular MaxSAT solver
- PBLib -- a library for encoding pseudo-Boolean constraints into CNF
- Rule extraction from support vector machines: an introduction
- Rule extraction from support vector machines: an overview of issues and application in credit scoring
- SAT-based encodings for optimal decision trees with explicit paths
- Separate-and-conquer rule learning
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The first and second Max-SAT evaluations
Cited in
(3)
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)