Canonical decomposition of dichotomous basic belief assignment - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Intelligent Systems Année : 2020

Canonical decomposition of dichotomous basic belief assignment

Décomposition canonique de fonctions de croyance dichotomiques

Florentin Smarandache

Résumé

In this paper, we prove that any dichotomous basic belief assignment (BBA) m can be expressed as the combination of two simple belief assignments mp and mc called respectively the pros and cons BBAs thanks to the proportional conflict redistribution rule no 5 (PCR5). This decomposition always exists and is unique and we call it the canonical decomposition of the BBA m. We also show that canonical decompositions do not exist in general if we use the conjunctive rule, the disjunctive rule, Dempster's rule, Dubois & Prade's or Yager's rules, or even the averaging rule of combination. We give some numerical examples of canonical decompositions and discuss of the potential interest of this canonical decomposition for applications in information fusion.
Fichier principal
Vignette du fichier
DTIS20053.1587974706_postprint.pdf (723.96 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02873613 , version 1 (18-06-2020)

Identifiants

Citer

Jean Dezert, Florentin Smarandache. Canonical decomposition of dichotomous basic belief assignment. International Journal of Intelligent Systems, 2020, 35 (7), pp.1105-1125. ⟨10.1002/int.22236⟩. ⟨hal-02873613⟩
17 Consultations
30 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More