.png){kind=icon}
.png){kind=icon}
Return
Credal ensembling in multi-class classification
.png){kind=icon}
OA
AI
DOI：10.1007/s10994-024-06703-y.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we present a formal framework to (1) aggregate probabilistic ensemble members into either a representative classifier or a credal classifier, and (2) perform various decision tasks based on this uncertainty quantification. We first elaborate on the aggregation problem under a class of distances between distributions. We then propose generic methods to robustify uncertainty quantification and decisions, based on the obtained ensemble and representative probability. To facilitate the scalability of the proposed framework, for all the problems and applications covered, we elaborate on their computational complexities from the theoretical aspects and leverage theoretical results to derive efficient algorithmic solutions. Finally, relevant sets of experiments are conducted to assess the usefulness of the proposed framework in uncertainty sampling, classification with a reject option, and set-valued prediction-making.
Keywords:
Credal ensembling
Quantile-based approach
Uncertainty sampling
Classification with a reject option
Set-valued prediction
Journal
IF:
2.9
Papers:
2.6K
Citations:
3.4W