mlsanityData to 7 Oct 2026

Conceptual Views on Tree Ensemble Classifiers

arXiv 2302.05270 ↗First posted 10 Feb 2023cs.LG cs.AI cs.LOcited by 3

Not on the map. Why?

Abstract (arXiv)

Random Forests and related tree-based methods are popular for supervised learning from table based data. Apart from their ease of parallelization, their classification performance is also superior. However, this performance, especially parallelizability, is offset by the loss of explainability. Statistical methods are often used to compensate for this disadvantage. Yet, their ability for local explanations, and in particular for global explanations, is limited. In the present work we propose an algebraic method, rooted in lattice theory, for the (global) explanation of tree ensembles. In detail, we introduce two novel conceptual views on tree ensemble classifiers and demonstrate their explanatory capabilities on Random Forests that were trained with standard parameters.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 12 of its 46 references that are in the map. First posted on arXiv 10 Feb 2023.

Builds on

12 of 46 references.

References · 12

  1. 2017OpenML Benchmarking Suitescited by 169
  2. 2018Hyperparameters and Tuning Strategies for Random Forestcited by 83
  3. 2019OpenML-Python: an extensible Python API for OpenMLcited by 62
  4. 2020Born-Again Tree Ensemblescited by 38
  5. 2016On interestingness measures of formal conceptscited by 8
  6. 2020On the Lattice of Conceptual Measurementscited by 8
  7. 2020Knowledge Cores in Large Formal Contextscited by 7
  8. 2018Relevant Attributes in Formal Contextscited by 5
  9. 2021Attribute Selection using Contranominal Scalescited by 4
  10. 2022On Uncertainty Estimation by Tree-based Surrogate Models in Sequential Model-based Optimizationcited by 4
  11. 2022Contextual Decision Treescited by 2
  12. 2021Decision Concept Lattice vs. Decision Trees and Random Forestscited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 1; 2025: 0; 2026: 1.

3 papers.