Interpretation and Computation of alpha-Junctions for Combining Belief Functions - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Interpretation and Computation of alpha-Junctions for Combining Belief Functions

Résumé

The alpha-junctions are the associative, commutative and linear operators for belief functions with a neutral element. This family of rules includes as particular cases the unnormalized Dempster's rule and the disjunctive rule. Until now, the -junctions suffered from two main limitations. First, they did not have an interpretation in the general case. Second, it was difficult to compute a combination by an -junction. In this paper, an interpretation for these rules is proposed. It is shown that the alpha-junctions correspond to a particular form of knowledge about the truthfulness of the sources providing the belief functions to be combined. Simple means to compute a combination by an alpha-junction are also laid bare. These means are based on generalizations of mechanisms that exist to compute the combination by the unnormalized Dempster's rule.
Fichier principal
Vignette du fichier
isipta09-2.pdf (197.12 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00450984 , version 1 (27-01-2010)

Identifiants

  • HAL Id : hal-00450984 , version 1

Citer

Frédéric Pichon, Thierry Denoeux. Interpretation and Computation of alpha-Junctions for Combining Belief Functions. 6th International Symposium on Imprecise Probability: Theories and Applications (ISIPTA '09), 2009, Durham, United Kingdom. ⟨hal-00450984⟩
108 Consultations
78 Téléchargements

Partager

Gmail Facebook X LinkedIn More