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...
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: | |
Online Access: | https://www.mdpi.com/2504-4990/6/1/31 |
Similar Items
-
No silver bullet: interpretable ML models must be explained
by: Joao Marques-Silva, et al.
Published: (2023-04-01) -
Iterative Oblique Decision Trees Deliver Explainable RL Models
by: Raphael C. Engelhardt, et al.
Published: (2023-05-01) -
Alternative Formulations of Decision Rule Learning from Neural Networks
by: Litao Qiao, et al.
Published: (2023-08-01) -
Business rules in the agricultural area
by: I. Rábová
Published: (2006-07-01) -
Operational Rule Extraction and Construction Based on Task Scenario Analysis
by: Xinye Zhao, et al.
Published: (2022-03-01)