paper-with-me

홈 › Papers

Probability Calibration Trees

2018-07-31 · Tim Leathart, Eibe Frank, Geoffrey Holmes, Bernhard Pfahringer

Obtaining accurate and well calibrated probability estimates from classifiers is useful in many applications, for example, when minimising the expected cost of classifications. Existing methods of calibrating probability estimates are applied globally, ignoring the potential for improvements by applying a more fine-grained model. We propose probability calibration trees, a modification of logistic model trees that identifies regions of the input space in which different probability calibration models are learned to improve performance. We compare probability calibration trees to two widely used calibration methods---isotonic regression and Platt scaling---and show that our method results in lower root mean squared error on average than both methods, for estimates produced by a variety of base learners.

📄 PDF Abstract BibTeX arXiv:1808.00111

Code (0)

등록된 구현이 없습니다.

Tasks

regression

Similar Papers 제목 키워드 기반

Shape from Silhouette Probability Maps: Reconstruction of Thin Objects in the Presence of Silhouette Extraction and Calibration Error

2013-06-01 · CVPR 2013 6 · Amy Tabb

This paper considers the problem of reconstructing the shape of thin, texture-less objects such as leafless trees when there is noise or deterministic error in the silhouette extraction step or there are small errors in …

Camera Calibration

The Manokhin Probability Matrix: A Diagnostic Framework for Classifier Probability Quality

2026-05-05 · Valery Manokhin arxiv

The Brier score conflates two distinct properties of probabilistic predictions: reliability (calibration error) and resolution (discriminatory power). We introduce the Manokhin Probability Matrix, a BCG-style two-dimensi…

Binary Classification

Maximum Spanning Trees Are Invariant to Temperature Scaling in Graph-based Dependency Parsing

2021-06-15 · Stefan Grünewald

Modern graph-based syntactic dependency parsers operate by predicting, for each token within a sentence, a probability distribution over its possible syntactic heads (i.e., all other tokens) and then extracting a maximum…

Dependency ParsingSentence

Efficient distributional regression trees learning algorithms for calibrated non-parametric probabilistic forecasts

2025-02-07 · Duchemin Quentin, Obozinski Guillaume

The perspective of developing trustworthy AI for critical applications in science and engineering requires machine learning techniques that are capable of estimating their own uncertainty. In the context of regression, i…

Conformal Prediction

MBCT: Tree-Based Feature-Aware Binning for Individual Uncertainty Calibration

2022-02-09 · Siguang Huang, Yunli Wang, Lili Mou, Huayue Zhang 외

Most machine learning classifiers only concern classification accuracy, while certain applications (such as medical diagnosis, meteorological forecasting, and computation advertising) require the model to predict the tru…

Medical Diagnosis