A Rule-Based Inference Method Using Dempster–Shafer Theory

Author(s):  
Liuqian Jin ◽  
Yang Xu
2019 ◽  
Vol 15 (1) ◽  
pp. 155014771882399 ◽  
Author(s):  
Lei Chen ◽  
Ling Diao ◽  
Jun Sang

Managing conflict in Dempster–Shafer theory is a popular topic. In this article, we propose a novel weighted evidence combination rule based on improved entropy function. This newly proposed approach can be mainly divided into two steps. First, the initial weight will be determined on the basis of the distance of evidence. Then, this initial weight will be modified using improved entropy function. This new method converges faster when handling high conflicting evidences and greatly reduces uncertainty of decisions, which can be demonstrated by a numerical example where the belief degree is raised up to 0.9939 when five evidences are in conflict, an application in faulty diagnosis where belief degree is increased hugely from 0.8899 to 0.9416 when compared with our previous works, and a real-life medical diagnosis application where the uncertainty of decision is reduced to nearly 0 and the belief degree is raised up to 0.9989.


2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Lei Chen ◽  
Ling Diao ◽  
Jun Sang

Conflict management in Dempster-Shafer theory (D-S theory) is a hot topic in information fusion. In this paper, a novel weighted evidence combination rule based on evidence distance and uncertainty measure is proposed. The proposed approach consists of two steps. First, the weight is determined based on the evidence distance. Then, the weight value obtained in first step is modified by taking advantage of uncertainty. Our proposed method can efficiently handle high conflicting evidences with better performance of convergence. A numerical example and an application based on sensor fusion in fault diagnosis are given to demonstrate the efficiency of our proposed method.


2002 ◽  
Vol 1804 (1) ◽  
pp. 173-178 ◽  
Author(s):  
Lawrence A. Klein ◽  
Ping Yi ◽  
Hualiang Teng

The Dempster–Shafer theory for data fusion and mining in support of advanced traffic management is introduced and tested. Dempste–Shafer inference is a statistically based classification technique that can be applied to detect traffic events that affect normal traffic operations. It is useful when data or information sources contribute partial information about a scenario, and no single source provides a high probability of identifying the event responsible for the received information. The technique captures and combines whatever information is available from the data sources. Dempster’s rule is applied to determine the most probable event—as that with the largest probability based on the information obtained from all contributing sources. The Dempster–Shafer theory is explained and its implementation described through numerical examples. Field testing of the data fusion technique demonstrated its effectiveness when the probability masses, which quantify the likelihood of the postulated events for the scenario, reflect current traffic and weather conditions.


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.


Sign in / Sign up

Export Citation Format

Share Document