Conceptual Views on Tree Ensemble Classifiers
Preprint
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
All Related Versions
This publication has 11 references indexed in Scilit:
- On the lattice of conceptual measurementsInformation Sciences, 2022
- Knowledge cores in large formal contextsAnnals of Mathematics and Artificial Intelligence, 2022
- Attribute Selection Using Contranominal Scales2021
- Relevant Attributes in Formal Contexts2019
- Hyperparameters and tuning strategies for random forestWIREs Data Mining and Knowledge Discovery, 2019
- On interestingness measures of formal conceptsInformation Sciences, 2018
- Permutation importance: a corrected feature importance measureBioinformatics, 2010
- Computing iceberg concept lattices with TitanicData & Knowledge Engineering, 2002
- Stochastic gradient boostingComputational Statistics & Data Analysis, 2002
- Random ForestsMachine Learning, 2001