Dempster-Shafer theory is widely applied in uncertainty modelling and knowledge reasoning due to its ability of expressing uncertain information. A distance between two basic probability assignments(BPAs) presents a measure of performance for identification algorithms based on the evidential theory of Dempster-Shafer. However, some conditions lead to limitations in practical application for Dem...

Evidence reasoning has good performance in dealing with uncertain information. But in general, Dempster’ s rule is suitable to solve the problem with high belief and low conflict. In this paper, the drawbacks of Dempster’ s rule mentioned above are analyzed firstly. According to the different resource of conflict, two methods are proposed to solve the problem of high conflict. Furthermore, a ne...

This paper presents Dempster-Shafer Theory for insect diseases detection. Sustainable elimination of insect diseases as a public-health problem is feasible and requires continuous efforts and innovative approaches. In this research, we used Dempster-Shafer theory for detecting insect diseases and displaying the result of detection process. Insect diseases which include babesiosis, dengue fever,...

Dempster-Shafer theory is widely applied to uncertainty modelling and knowledge reasoning due to its ability of expressing uncertain information. However, some conditions, such as exclusiveness hypothesis and completeness constraint, limit its development and application to a large extend. To overcome these shortcomings in Dempster-Shafer theory and enhance its capability of representing uncert...

The Dempster-Shafer theory of evidence accumulation is one of the main tools for combining data obtained from multiple sources. In this paper a special case of combination of two bodies of evidence with non-zero conflict coefficient is considered. It is shown that application of the Dempster-Shafer rule of combination in this case leads to an evaluation of masses of the combined bodies that is ...

This paper responds to a number of criticisms of Dempster-Shafer theory made by Judea Pearl. He criticises Dempster-Shafer belief for not obeying the laws of Bayesian belief," however, these laws lead to well-known problems in the face of ignorance, and seem unreasonably restrictive. It is argued that it is not reasonable to expect a measure of belief to obey Pearl's sandwich principle. The sta...

This paper describes a novel methodology for predicting fault prone modules. The methodology is based on Dempster-Shafer (D-S) belief networks. Our approach consists of three steps: First, building the Dempster-Shafer network by the induction algorithm; Second, selecting the predictors (attributes) by the logistic procedure; Third, feeding the predictors describing the modules of the current pr...

We recall the existence of two methods for conditioning belief functions due to Dempster: one, known as Dempster conditioning, that applies Bayesian conditioning to the plausibility function and one that performs a sensitivity analysis on a conditional probability. We recall that while the first one is dedicated to revising a belief function, the other one is tailored to a prediction problem wh...

How to extend standard support vector machines to solve multi-class classification problem and yield the outputs in the frame of Dempster-Shafer theory is useful. The multi-class probability support vector machine is proposed, firstly. The Dempster-Shafer theory based multi-class support vector machine is designed by constructing probability support vector machines for binary classification usi...

An algorithm for updating the evidence in the Dempster–Shafer theory is presented. The algorithm is based on an idea of indices. These indices are used to code the process of reasoning under uncertainty (the combination of evidence)using the Dempster-Shafer theory. The algorithm allows to carry out the reasoning with updating the evidence in much more efficient way than using the original Demps...