Explainable models via compression of tree ensembles

Ensemble models (bagging and gradient-boosting) of relational decision trees have proved to be some of the most effective learning methods in the area of probabilistic logic models (PLMs). While effective, they lose one of the most important benefits of PLMs—interpretability. In this paper we consid...

Full description

Saved in:
Bibliographic Details
Published inMachine learning Vol. 113; no. 3; pp. 1303 - 1328
Main Authors Yan, Siwen, Natarajan, Sriraam, Joshi, Saket, Khardon, Roni, Tadepalli, Prasad
Format Journal Article
LanguageEnglish
Published New York Springer US 01.03.2024
Springer Nature B.V
Subjects
Online AccessGet full text

Cover

Loading…