Improving the AUC of Probabilistic Estimation Trees
Abstract
In this work we investigate several issues in order to improve the performance of probabilistic estimation trees (PETs). First, we derive a new probability smoothing that takes into account the class distributions of all the nodes from the root to each leaf. Secondly, we introduce or adapt some new splitting criteria aimed at improving probability estimates rather than improving classification accuracy, and compare them with other accuracy-aimed splitting criteria. Thirdly, we analyse the effect of pruning methods and we choose a cardinality-based pruning, which is able to significantly reduce the size of the trees without degrading the quality of the estimates. The quality of probability estimates of these three issues is evaluated by the 1-vs-1 multi-class extension of the Area Under the ROC Curve (AUC) measure, which is becoming widespread for evaluating probability estimators, ranking of predictions in particular.
Cite
Text
Ferri et al. "Improving the AUC of Probabilistic Estimation Trees." European Conference on Machine Learning, 2003. doi:10.1007/978-3-540-39857-8_13Markdown
[Ferri et al. "Improving the AUC of Probabilistic Estimation Trees." European Conference on Machine Learning, 2003.](https://mlanthology.org/ecmlpkdd/2003/ferri2003ecml-improving/) doi:10.1007/978-3-540-39857-8_13BibTeX
@inproceedings{ferri2003ecml-improving,
title = {{Improving the AUC of Probabilistic Estimation Trees}},
author = {Ferri, César and Flach, Peter A. and Hernández-Orallo, José},
booktitle = {European Conference on Machine Learning},
year = {2003},
pages = {121-132},
doi = {10.1007/978-3-540-39857-8_13},
url = {https://mlanthology.org/ecmlpkdd/2003/ferri2003ecml-improving/}
}