Skip to Main content Skip to Navigation
Journal articles

Cautious classification with nested dichotomies and imprecise probabilities

Abstract : In some applications of machine learning and information retrieval (e.g. medical diagnosis, image recognition, pre-classification...), it can be preferable to provide less informative but more reliable predictions. This can be done by making partial predictions in the form of class subsets when the available information is insufficient to provide a reliable unique class. Imprecise probabilistic approaches offer nice tools to learn models from which such cautious predictions can be produced. However, the learning and inference processes of such models are computationally harder than their precise counterparts. In this paper, we introduce and study a particular binary decomposition strategy, nested dichotomies, that offer computational advantages in both the learning (due to the binarization process) and the inference (due to the decomposition strategy) processes. We show with experiments that these computational advantages do not lower the performances of the classifiers, and can even improve them when the class space has some structure.
Document type :
Journal articles
Complete list of metadata
Contributor : Laboratoire Heudiasyc Connect in order to contact the contributor
Submitted on : Monday, June 21, 2021 - 9:20:13 PM
Last modification on : Tuesday, November 16, 2021 - 4:30:23 AM
Long-term archiving on: : Wednesday, September 22, 2021 - 7:10:17 PM


Files produced by the author(s)




Gen Yang, Sébastien Destercke, Marie-Hélène Masson. Cautious classification with nested dichotomies and imprecise probabilities. Soft Computing, Springer Verlag, 2017, 21 (4), pp.7447-7462. ⟨10.1007/s00500-016-2287-7⟩. ⟨hal-01374060⟩



Les métriques sont temporairement indisponibles