LIBRE: Learning Interpretable Boolean Rule Ensembles
Not on the map. Why?
Abstract (arXiv)
We present a novel method - LIBRE - to learn an interpretable classifier, which materializes as a set of Boolean rules. LIBRE uses an ensemble of bottom-up weak learners operating on a random subset of features, which allows for the learning of rules that generalize well on unseen data even in imbalanced settings. Weak learners are combined with a simple union so that the final ensemble is also interpretable. Experimental results indicate that LIBRE efficiently strikes the right balance between prediction accuracy, which is competitive with black box methods, and interpretability, which is often superior to alternative methods from the literature.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 15 Nov 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 3; 2025: 0; 2026: 1.
6 papers.
- 2022Learning Interpretable Decision Rule Sets: A Submodular Optimization Approachcited by 13
- 2024CURLS: Causal Rule Learning for Subgroups with Significant Treatment Effectcited by 2
- 2024Spectral Clustering of Categorical and Mixed-type Data via Extra Graph Nodescited by 1
- 2023Personalized Interpretable Classificationcited by 0
- 2024An Incremental MaxSAT-based Model to Learn Interpretable and Balanced Classification Rulescited by 0
- 2026Learning High Coverage Discriminative Parsimonious Rulesetscited by 0
- 2026Learning High Coverage Discriminative Parsimonious Rulesets12 Jun 2026
- 2024CURLS: Causal Rule Learning for Subgroups with Significant Treatment Effect1 Jul 2024
- 2024An Incremental MaxSAT-based Model to Learn Interpretable and Balanced Classification Rules25 Mar 2024
- 2024Spectral Clustering of Categorical and Mixed-type Data via Extra Graph Nodes8 Mar 2024
- 2023Personalized Interpretable Classification6 Feb 2023
- 2022Learning Interpretable Decision Rule Sets: A Submodular Optimization Approach8 Jun 2022