Evidential reasoning in large partially ordered sets. Application to multi-label classification, ensemble clustering and preference aggregation - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Annals of Operations Research Année : 2012

Evidential reasoning in large partially ordered sets. Application to multi-label classification, ensemble clustering and preference aggregation

Résumé

The Dempster-Shafer theory of belief functions has proved to be a powerful formalism for uncertain reasoning. However, belief functions on a finite frame of discernment Omega are usually defined in the power set 2^Omega, resulting in exponential complexity of the operations involved in this framework, such as combination rules. When Omega is linearly ordered, a usual trick is to work only with intervals, which drastically reduces the complexity of calculations. In this paper, we show that this trick can be extrapolated to frames endowed with an arbitrary lattice structure, not necessarily a linear order. This principle makes it possible to apply the Dempster-Shafer framework to very large frames such as the power set, the set of partitions, or the set of preorders of a finite set. Applications to multi-label classification, ensemble clustering and preference aggregation are demonstrated.
Fichier principal
Vignette du fichier
aor2011.pdf (274.51 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00684520 , version 1 (02-04-2012)

Identifiants

Citer

Thierry Denoeux, Marie-Hélène Masson. Evidential reasoning in large partially ordered sets. Application to multi-label classification, ensemble clustering and preference aggregation. Annals of Operations Research, 2012, 195 (1), pp.135-161. ⟨10.1007/s10479-011-0887-2⟩. ⟨hal-00684520⟩
102 Consultations
120 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More