Dissertation · 2026 · Open access
Probabilistic Smoothing for Tree and Rule Ensemble Methods
Monash University · Published 13 September 2026 · DOI 10.26180/33697057
In brief
“Probabilistic Smoothing for Tree and Rule Ensemble Methods” is a 2026 dissertation by Ziyi Liu, published in Monash University. OpenAlex counts 0 citations as of 16 November 2026. It is open access: the full text is free to read at Monash University.
- Citations
- 0
- Authors
- 1
Abstract
This thesis develops a framework for making predictions from tree-based machine learning models smoother and more reliable. Standard methods of this type produce uneven prediction surfaces and poorly estimated uncertainties, limiting their use in risk-sensitive decisions. This thesis applies kernel smoothing to two model families — random forests and rule ensembles — to address both problems simultaneously. The approach produces well-calibrated uncertainty estimates across varying data sizes, while rule ensembles retain their interpretability. Testing on real-world datasets shows consistent and stable performance. This work demonstrates that smoothing is a practical and principled way to improve the reliability of tree-based machine learning models.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Liu, Z. (2026). Probabilistic Smoothing for Tree and Rule Ensemble Methods. Monash University. https://doi.org/10.26180/33697057
MLA 9
Liu, Ziyi. “Probabilistic Smoothing for Tree and Rule Ensemble Methods.” Monash University, 2026. https://doi.org/10.26180/33697057.
Chicago
Liu, Ziyi. 2026. “Probabilistic Smoothing for Tree and Rule Ensemble Methods.” Monash University. https://doi.org/10.26180/33697057.
Harvard
Liu, Z. (2026) ‘Probabilistic Smoothing for Tree and Rule Ensemble Methods’, Monash University. doi:10.26180/33697057.
IEEE
Z. Liu, “Probabilistic Smoothing for Tree and Rule Ensemble Methods,” Monash University, 2026, doi: 10.26180/33697057.
BibTeX
@phdthesis{liu2026probabilistic,
title = {{Probabilistic Smoothing for Tree and Rule Ensemble Methods}},
author = {Liu, Ziyi},
year = {2026},
doi = {10.26180/33697057},
url = {https://doi.org/10.26180/33697057}
}
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)
- kernel smoothing
- random forest
- rule ensembles
- uncertainty estimation
- calibration
- tree-based models
- interpretability
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?
Liu, Z. (2026). Probabilistic Smoothing for Tree and Rule Ensemble Methods. Monash University. https://doi.org/10.26180/33697057
How many times has this paper been cited?
0 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 Monash University.
Who wrote this paper?
Ziyi Liu.
What is the DOI of this paper?
10.26180/33697057. The permanent link is https://doi.org/10.26180/33697057.
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.