ORCID: https://orcid.org/0009-0009-8422-299X und Hüllermeier, Eyke
ORCID: https://orcid.org/0000-0002-9944-4108
(25. Oktober 2025):
Random forest calibration.
In: Knowledge-Based Systems, Bd. 328: S. 114-143
[PDF, 6MB]

Abstract
The Random Forest (RF) classifier is often claimed to be relatively well calibrated when compared with other machine learning methods. Moreover, the existing literature suggests that traditional calibration methods, such as isotonic regression, do not substantially enhance the calibration of RF probability estimates unless supplied with extensive calibration data sets, which can represent a significant obstacle in cases of limited data availability. Nevertheless, there seems to be no comprehensive study validating such claims and systematically comparing state-of-the-art calibration methods specifically for RF. To close this gap, we investigate a broad spectrum of calibration methods tailored to or at least applicable to RF, ranging from simple scaling techniques to more advanced algorithms. Our results based on synthetic as well as real-world data unravel the intricacies of RF probability estimates, scrutinize the impact of hyper-parameters, and compare calibration methods in a systematic way. We demonstrate that a well-optimized RF matches or outperforms state-of-the-art calibration methods. In particular, statistical tests on metrics such as accuracy, ECE, Brier score, and log-loss consistently place the optimized RF among the top-performing group.
Dokumententyp: | Zeitschriftenartikel |
---|---|
Publikationsform: | Publisher's Version |
Fakultät: | Mathematik, Informatik und Statistik > Informatik > Künstliche Intelligenz und Maschinelles Lernen |
Themengebiete: | 000 Informatik, Informationswissenschaft, allgemeine Werke > 004 Informatik |
URN: | urn:nbn:de:bvb:19-epub-128362-5 |
ISSN: | 09507051 |
Sprache: | Englisch |
Dokumenten ID: | 128362 |
Datum der Veröffentlichung auf Open Access LMU: | 09. Sep. 2025 16:41 |
Letzte Änderungen: | 09. Sep. 2025 16:41 |