An Evidential Reasoning Approach to Land Degradation Evaluation: Dempster-Shafer Theory of Evidence

2005 ◽  
Vol 9 (4) ◽  
pp. 507-520 ◽  
Author(s):  
Amadou K. Thiam

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.



Author(s):  
Malcolm J. Beynon

The origins of Dempster-Shafer theory (DST) go back to the work by Dempster (1967) who developed a system of upper and lower probabilities. Following this, his student Shafer (1976), in his book “A Mathematical Theory of Evidence” added to Dempster’s work, including a more thorough explanation of belief functions. In summary, it is a methodology for evidential reasoning, manipulating uncertainty and capable of representing partial knowledge (Haenni & Lehmann, 2002; Kulasekere, Premaratne, Dewasurendra, Shyu, & Bauer, 2004; Scotney & McClean, 2003).



Sensors ◽  
2020 ◽  
Vol 20 (13) ◽  
pp. 3727
Author(s):  
Joel Dunham ◽  
Eric Johnson ◽  
Eric Feron ◽  
Brian German

Sensor fusion is a topic central to aerospace engineering and is particularly applicable to unmanned aerial systems (UAS). Evidential Reasoning, also known as Dempster-Shafer theory, is used heavily in sensor fusion for detection classification. High computing requirements typically limit use on small UAS platforms. Valuation networks, the general name given to evidential reasoning networks by Shenoy, provides a means to reduce computing requirements through knowledge structure. However, these networks use conditional probabilities or transition potential matrices to describe the relationships between nodes, which typically require expert information to define and update. This paper proposes and tests a novel method to learn these transition potential matrices based on evidence injected at nodes. Novel refinements to the method are also introduced, demonstrating improvements in capturing the relationships between the node belief distributions. Finally, novel rules are introduced and tested for evidence weighting at nodes during simultaneous evidence injections, correctly balancing the injected evidenced used to learn the transition potential matrices. Together, these methods enable updating a Dempster-Shafer network with significantly less user input, thereby making these networks more useful for scenarios in which sufficient information concerning relationships between nodes is not known a priori.



2017 ◽  
Vol 24 (2) ◽  
pp. 653-669 ◽  
Author(s):  
Ningkui WANG ◽  
Daijun WEI

Environmental impact assessment (EIA) is usually evaluated by many factors influenced by various kinds of uncertainty or fuzziness. As a result, the key issues of EIA problem are to rep­resent and deal with the uncertain or fuzzy information. D numbers theory, as the extension of Dempster-Shafer theory of evidence, is a desirable tool that can express uncertainty and fuzziness, both complete and incomplete, quantitative or qualitative. However, some shortcomings do exist in D numbers combination process, the commutative property is not well considered when multiple D numbers are combined. Though some attempts have made to solve this problem, the previous method is not appropriate and convenience as more information about the given evaluations rep­resented by D numbers are needed. In this paper, a data-driven D numbers combination rule is proposed, commutative property is well considered in the proposed method. In the combination process, there does not require any new information except the original D numbers. An illustrative example is provided to demonstrate the effectiveness of the method.



Sign in / Sign up

Export Citation Format

Share Document