Conceptual Views on Tree Ensemble Classifiers

Tom Hanika, Johannes Hirth
2/10/2023
cs.LGcs.AIcs.LO

No confident code implementation found for this paper.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{hanika2023conceptual,
  title  = {Conceptual Views on Tree Ensemble Classifiers},
  author = {Tom Hanika and Johannes Hirth},
  year   = {2023},
  eprint = {2302.05270},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2302.05270v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2302.05270.svg)](https://codeofpaper.com/paper/2302.05270)

Discussion