mlsanityData to 7 Oct 2026

Forest-ORE: Mining Optimal Rule Ensemble to interpret Random Forest models

arXiv 2403.17588 ↗First posted 26 Mar 2024cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Random Forest (RF) is well-known as an efficient ensemble learning method in terms of predictive performance. It is also considered a Black Box because of its hundreds of deep decision trees. This lack of interpretability can be a real drawback for acceptance of RF models in several real-world applications, especially those affecting one's lives, such as in healthcare, security, and law. In this work, we present Forest-ORE, a method that makes RF interpretable via an optimized rule ensemble (ORE) for local and global interpretation. Unlike other rule-based approaches aiming at interpreting the RF model, this method simultaneously considers several parameters that influence the choice of an interpretable rule ensemble. Existing methods often prioritize predictive performance over interpretability coverage and do not provide information about existing overlaps or interactions between rules. Forest-ORE uses a mixed-integer optimization program to build an ORE that considers the trade-off between predictive performance, interpretability coverage, and model size (size of the rule ensemble, rule lengths, and rule overlaps). In addition to providing an ORE competitive in predictive performance with RF, this method enriches the ORE through other rules that afford complementary information. It also enables monitoring of the rule selection process and delivers various metrics that can be used to generate a graphical representation of the final model. This framework is illustrated through an example, and its robustness is assessed through 36 benchmark datasets. A comparative analysis of well-known methods shows that Forest-ORE provides an excellent trade-off between predictive performance, interpretability coverage, and model size.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 18 of its 96 references that are in the map. First posted on arXiv 26 Mar 2024.

Builds on

18 of 96 references.

References · 18

  1. 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
  2. 2016European Union regulations on algorithmic decision-making and a "right to explanation"cited by 343
  3. 2015A Random Forest Guided Tourcited by 168
  4. 2018Local Rule-Based Explanations of Black Box Decision Systemscited by 165
  5. 2015Interpretable classifiers using rules and Bayesian analysis: Building a better stroke prediction modelcited by 140
  6. 2015Should we really use post-hoc tests based on mean-ranks?cited by 116
  7. 2018Boolean Decision Rules via Column Generationcited by 79
  8. 2016Scalable Bayesian Rule Listscited by 64
  9. 2014Interpreting Tree Ensembles with inTreescited by 37
  10. 2016Making Tree Ensembles Interpretable: A Bayesian Model Selection Approachcited by 27
  11. 2021Conclusive Local Interpretation Rules for Random Forestscited by 9
  12. 2018A Parallel Random Forest Algorithm for Big Data in a Spark Cloud Computing Environmentcited by 6
6 more
  1. 2016Programs as Black-Box Explanationscited by 5
  2. 2020Rule Covering for Interpretation and Boostingcited by 4
  3. 2021Extracting Optimal Explanations for Ensemble Trees via Logical Reasoningcited by 4
  4. 2014Visualizing Random Forest with Self-Organising Mapcited by 2
  5. 2015ggRandomForests: Visually Exploring a Random Forest for Regressioncited by 2
  6. 2016Forest Floor Visualizations of Random Forestscited by 2

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.