Journal article · 2024 · Open access
Tree smoothing: Post-hoc regularization of tree ensembles for interpretable machine learning
Information Sciences, 690, 121564 · Published 16 October 2024 · DOI 10.1016/j.ins.2024.121564
In brief
“Tree smoothing: Post-hoc regularization of tree ensembles for interpretable machine learning” is a 2024 journal article by Bastian Pfeifer and 3 co-authors, published in Information Sciences. OpenAlex counts 28 citations as of 16 November 2026, which puts it in the top 3% of works published in 2024 by citations. It is open access under a CC BY licence: the full text is free to read at Information Sciences.
- Citations
- 28
- Most cited in
- 2026 (23)
- Field-weighted impact
- 2.91
- References
- 34
- Authors
- 4
Abstract
Random Forests (RFs) are powerful ensemble learning algorithms that are widely used in various machine learning tasks. However, they tend to overfit noisy or irrelevant features, which can result in decreased generalization performance. Post-hoc regularization techniques aim to solve this problem by modifying the structure of the learned ensemble after training. We propose a novel post-hoc regularization via tree smoothing for classification tasks to leverage the reliable class distributions closer to the root node whilst reducing the impact of more specific and potentially noisy splits deeper in the tree. Our novel approach allows for a form of pruning that does not alter the general structure of the trees, adjusting the influence of nodes based on their proximity to the root node. We evaluated the performance of our method on various machine learning benchmark data sets and on cancer data from The Cancer Genome Atlas (TCGA). Our approach demonstrates competitive performance compared to the state-of-the-art and, in the majority of cases, and outperforms it in most cases in terms of prediction accuracy, generalization, and interpretability. • A novel post-regulation technique for Tree Ensembles called BBTS is introduced. • Interpretability is improved through posterior distributions in the leaf nodes. • This method allows the incorporation of domain knowledge through prior beliefs. • It was tested using ML benchmarks and real-world cancer data from the TCGA database. • BBTS has proven itself with the state-of-the-art and exceeds them on real-world cancer data.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Pfeifer, B., Gevaert, A., Loecher, M., & Holzinger, A. (2024). Tree smoothing: Post-hoc regularization of tree ensembles for interpretable machine learning. Information Sciences, 690, 121564. https://doi.org/10.1016/j.ins.2024.121564
MLA 9
Pfeifer, Bastian, et al. “Tree smoothing: Post-hoc regularization of tree ensembles for interpretable machine learning.” Information Sciences, vol. 690, 2024, p. 121564. https://doi.org/10.1016/j.ins.2024.121564.
Chicago
Pfeifer, Bastian, Arne Gevaert, Markus Loecher, and Andreas Holzinger. 2024. “Tree smoothing: Post-hoc regularization of tree ensembles for interpretable machine learning.” Information Sciences 690: 121564. https://doi.org/10.1016/j.ins.2024.121564.
Harvard
Pfeifer, B. et al. (2024) ‘Tree smoothing: Post-hoc regularization of tree ensembles for interpretable machine learning’, Information Sciences, 690, p. 121564. doi:10.1016/j.ins.2024.121564.
IEEE
B. Pfeifer, A. Gevaert, M. Loecher, and A. Holzinger, “Tree smoothing: Post-hoc regularization of tree ensembles for interpretable machine learning,” Information Sciences, vol. 690, p. 121564, 2024, doi: 10.1016/j.ins.2024.121564.
BibTeX
@article{pfeifer2024tree,
title = {{Tree smoothing: Post-hoc regularization of tree ensembles for interpretable machine learning}},
author = {Pfeifer, Bastian and Gevaert, Arne and Loecher, Markus and Holzinger, Andreas},
journal = {Information Sciences},
year = {2024},
volume = {690},
pages = {121564},
doi = {10.1016/j.ins.2024.121564},
url = {https://doi.org/10.1016/j.ins.2024.121564}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Computer Science › Artificial Intelligence › Explainable Artificial Intelligence (XAI)
- random forest
- decision tree ensembles
- interpretability
- overfitting
- pruning
- posterior distribution
- leaf nodes
- domain knowledge integration
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Pfeifer, B., Gevaert, A., Loecher, M., & Holzinger, A. (2024). Tree smoothing: Post-hoc regularization of tree ensembles for interpretable machine learning. Information Sciences, 690, 121564. https://doi.org/10.1016/j.ins.2024.121564
How many times has this paper been cited?
28 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access: read the free full text at Information Sciences.
Who wrote this paper?
Bastian Pfeifer, Arne Gevaert, Markus Loecher, Andreas Holzinger.
What is the DOI of this paper?
10.1016/j.ins.2024.121564. The permanent link is https://doi.org/10.1016/j.ins.2024.121564.
Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.