Multilabel predictions with sets of probabilities: The Hamming and ranking loss cases - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Pattern Recognition Année : 2015

Multilabel predictions with sets of probabilities: The Hamming and ranking loss cases

Résumé

In this paper, we study how multilabel predictions can be obtained when our uncertainty is described by a convex set of probabilities. Such predictions, typically consisting of a set of potentially optimal decisions, are hard to make in large decision spaces such as the one considered in multilabel problems. However, we show that when considering the Hamming or the ranking loss, outer-approximating predictions can be efficiently computed from label-wise information, as in the precise case. We also perform some first experiments showing the behaviour of the partial predictions obtained through these approximations. Such experiments also confirm that predictions become partial on those labels where the precise prediction is likely to make an error.
Fichier principal
Vignette du fichier
Notes_els.pdf (194.04 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01179430 , version 1 (22-07-2015)

Identifiants

Citer

Sébastien Destercke. Multilabel predictions with sets of probabilities: The Hamming and ranking loss cases. Pattern Recognition, 2015, pp.3757-3765. ⟨10.1016/j.patcog.2015.04.020⟩. ⟨hal-01179430⟩
68 Consultations
995 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More