On (anti) conditional independence in Dempster-Shafer theory.

@article{Klopotek1998,
abstract = {This paper verifies a result of [9] concerning graphoidal structure of Shenoy's notion of independence for Dempster-Shafer theory belief functions. Shenoy proved that his notion of independence has graphoidal properties for positive normal valuations. The requirement of strict positive normal valuations as prerequisite for application of graphoidal properties excludes a wide class of DS belief functions. It excludes especially so-called probabilistic belief functions. It is demonstrated that the requirement of positiveness of valuation may be weakened in that it may be required that commonality function is non-zero for singleton sets instead, and the graphoidal properties for independence of belief function variables are then preserved. This means especially that probabilistic belief functions with all singleton sets as focal points possess graphoidal properties for independence.},
author = {Klopotek, Mieczyslaw A.},
journal = {Mathware and Soft Computing},
keywords = {Inteligencia artificial; Lógica difusa; Intervalo de confianza; Teorías probabilistas de seguridad; Medida de incertidumbre; Métodos gráficos; belief functions},
language = {eng},
number = {1},
pages = {69-89},
title = {On (anti) conditional independence in Dempster-Shafer theory.},
url = {http://eudml.org/doc/39121},
volume = {5},
year = {1998},
}

TY - JOUR
AU - Klopotek, Mieczyslaw A.
TI - On (anti) conditional independence in Dempster-Shafer theory.
JO - Mathware and Soft Computing
PY - 1998
VL - 5
IS - 1
SP - 69
EP - 89
AB - This paper verifies a result of [9] concerning graphoidal structure of Shenoy's notion of independence for Dempster-Shafer theory belief functions. Shenoy proved that his notion of independence has graphoidal properties for positive normal valuations. The requirement of strict positive normal valuations as prerequisite for application of graphoidal properties excludes a wide class of DS belief functions. It excludes especially so-called probabilistic belief functions. It is demonstrated that the requirement of positiveness of valuation may be weakened in that it may be required that commonality function is non-zero for singleton sets instead, and the graphoidal properties for independence of belief function variables are then preserved. This means especially that probabilistic belief functions with all singleton sets as focal points possess graphoidal properties for independence.
LA - eng
KW - Inteligencia artificial; Lógica difusa; Intervalo de confianza; Teorías probabilistas de seguridad; Medida de incertidumbre; Métodos gráficos; belief functions
UR - http://eudml.org/doc/39121
ER -