Why Do Tree Ensemble Approximators Not Outperform the Recursive-Rule eXtraction Algorithm?

Why Do Tree Ensemble Approximators Not Outperform the Recursive-Rule eXtraction Algorithm?

Although machine learning models are widely used in critical domains, their complexity and poor interpretability remain problematic. Decision trees (DTs) and rule-based models are known for their interpretability, and numerous studies have investigated techniques for approximating tree ensembles usi...

Full description

Bibliographic Details
Main Authors: Soma Onishi, Masahiro Nishimura, Ryota Fujimura, Yoichi Hayashi
Format: Article
Language:English
Published: MDPI AG 2024-03-01
Series:Machine Learning and Knowledge Extraction
Subjects:
interpretable machine learning
explainable artificial intelligence
rule extraction
rule-based model
decision list
decision tree
Online Access:https://www.mdpi.com/2504-4990/6/1/31

Internet

https://www.mdpi.com/2504-4990/6/1/31

Similar Items