A new distance-based total uncertainty measure in the theory of belief functions

2016 ◽  
Vol 94 ◽  
pp. 114-123 ◽  
Author(s):  
Yi Yang ◽  
Deqiang Han
Author(s):  
Rajendra P. Srivastava ◽  
Mari W. Buche ◽  
Tom L. Roberts

The purpose of this chapter is to demonstrate the use of the evidential reasoning approach under the Dempster-Shafer (D-S) theory of belief functions to analyze revealed causal maps (RCM). The participants from information technology (IT) organizations provided the concepts to describe the target phenomenon of Job Satisfaction. They also identified the associations between the concepts. This chapter discusses the steps necessary to transform a causal map into an evidential diagram. The evidential diagram can then be analyzed using belief functions technique with survey data, thereby extending the research from a discovery and explanation stage to testing and prediction. An example is provided to demonstrate these steps. This chapter also provides the basics of Dempster-Shafer theory of belief functions and a step-by-step description of the propagation process of beliefs in tree-like evidential diagrams.


Entropy ◽  
2020 ◽  
Vol 22 (4) ◽  
pp. 487 ◽  
Author(s):  
Miao Qin ◽  
Yongchuan Tang ◽  
Junhao Wen

Dempster–Shafer evidence theory (DS theory) has some superiorities in uncertain information processing for a large variety of applications. However, the problem of how to quantify the uncertainty of basic probability assignment (BPA) in DS theory framework remain unresolved. The goal of this paper is to define a new belief entropy for measuring uncertainty of BPA with desirable properties. The new entropy can be helpful for uncertainty management in practical applications such as decision making. The proposed uncertainty measure has two components. The first component is an improved version of Dubois–Prade entropy, which aims to capture the non-specificity portion of uncertainty with a consideration of the element number in frame of discernment (FOD). The second component is adopted from Nguyen entropy, which captures conflict in BPA. We prove that the proposed entropy satisfies some desired properties proposed in the literature. In addition, the proposed entropy can be reduced to Shannon entropy if the BPA is a probability distribution. Numerical examples are presented to show the efficiency and superiority of the proposed measure as well as an application in decision making.


2016 ◽  
Vol 110 ◽  
pp. 210-223 ◽  
Author(s):  
Deqiang Han ◽  
Weibing Liu ◽  
Jean Dezert ◽  
Yi Yang

1985 ◽  
Vol 24 (04) ◽  
pp. 177-180 ◽  
Author(s):  
J. Gouvernet ◽  
M. Caraboeuf ◽  
S. Ayme

SummaryThe method is based on a diagnosis data base, each diagnosis being identified by a list of signs indexed by à rough estimation of their relative frequency. Signs are terms of a tree-structured thesaurus, the relationship child – father being equivalent to implication. Furthermore, any sign is weighted according to the possibility of it being a variant characteristic rather than a pathological one. The patient’s description being provided, the credibility of each diagnosis is computed according to Glenn Shafer’s theory of belief functions, and the most plausible diagnoses are proposed for the clinician’s choice. The results obtained during a validation phase were satisfying so that we have been routinely using the model for assistance in diagnosing uncommon genetic syndromes observed in our hospital or submitted by other centers.


Sign in / Sign up

Export Citation Format

Share Document