English

Conceptual Views on Tree Ensemble Classifiers

Machine Learning 2023-07-25 v1 Artificial Intelligence Logic in Computer Science

Abstract

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.

Keywords

Cite

@article{arxiv.2302.05270,
  title  = {Conceptual Views on Tree Ensemble Classifiers},
  author = {Tom Hanika and Johannes Hirth},
  journal= {arXiv preprint arXiv:2302.05270},
  year   = {2023}
}
R2 v1 2026-06-28T08:37:05.078Z