Abstract:Tree ensembles are widely used in industrial machine learning due to their strong predictive performance and efficient training procedures. However, as the number of trees in an ensemble grows, the resulting models become increasingly difficult for humans to interpret. To address this limitation, explainable artificial intelligence (XAI) studies methods that generate interpretable models capable of explaining complex predictors. One approach consists of extracting decision rules from tree ensembles while attempting to preserve the predictive performance of the original model. In previous work, we introduced RuleCOSI+, a greedy heuristic algorithm for extracting compact rule-based models from tree ensembles. Although RuleCOSI+ produces accurate and interpretable rule sets, it relies on repeated empirical frequency counting over the training data to estimate rule confidence, which becomes computationally expensive for large datasets. In this paper, we propose RCProb, a probabilistic reformulation of RuleCOSI+ designed to reduce the computational cost of rule extraction. RCProb estimates rule statistics using Dirichlet-smoothed class priors and Beta-smoothed condition likelihoods combined through a Naive Bayes formulation, avoiding repeated dataset scans. Experiments on 33 benchmark datasets show that RCProb maintains competitive predictive performance while reducing runtime by approximately $22\times$ compared with RuleCOSI+, while producing more compact rule sets on average.
| Comments: | 20 pages, 3 figures. Submitted to Information Sciences, currently under review |
| Subjects: | Machine Learning (cs.LG) |
| MSC classes: | 68T05, 62H30, 68T37 |
| ACM classes: | I.2.6; I.2.1; H.4.2 |
| Cite as: | arXiv:2604.25304 [cs.LG] |
| (or arXiv:2604.25304v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2604.25304 arXiv-issued DOI via DataCite (pending registration) |
From: Josue Obregon [view email]
[v1]
Tue, 28 Apr 2026 07:12:15 UTC (166 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。