Share your thoughts, 1 month free Claude Pro on usSee more
WorkDL logo mark

Making Tree Ensembles Interpretable: A Bayesian Model Selection Approach

About

Tree ensembles, such as random forests and boosted trees, are renowned for their high prediction performance. However, their interpretability is critically limited due to the enormous complexity. In this study, we present a method to make a complex tree ensemble interpretable by simplifying the model. Specifically, we formalize the simplification of tree ensembles as a model selection problem. Given a complex tree ensemble, we aim at obtaining the simplest representation that is essentially equivalent to the original one. To this end, we derive a Bayesian model selection algorithm that optimizes the simplified model while maintaining the prediction performance. Our numerical experiments on several datasets showed that complicated tree ensembles were reasonably approximated as interpretable.

Satoshi Hara, Kohei Hayashi• 2016

Related benchmarks

TaskDatasetResultRank
ClassificationDementia Sc (test)
RSA66
14
Classificationthyroid (test)--
9
ClassificationAdult (test)
RSA81
7
Alzheimer's disease classificationMCI Screener (test)
Rule Set Accuracy (RSA)70
7
ClassificationWINE (test)
RSA Score0.67
7
ClassificationBREAST (test)
RSA91
7
Ruleset LearningSpam (test)
Max Rule-Width23
5
ClassificationHeart (test)
Coverage Rate89
5
ClassificationAdult (test)
Coverage Rate87
5
ClassificationStudent (test)
Coverage Rate90
5
Showing 10 of 26 rows

Other info

Follow for update