Conflict management in dempstershafer theory ds theory is a hot topic in information fusion. The dempstershafer theory of evidence accumulation is one of the main tools for combining data obtained from multiple sources. An algorithm for updating the evidence in the dempstershafer theory is presented. A new conflict management method in dempstershafer theory.
Weighted evidence combination based on distance of evidence. Section 4 provides a resume of some elementary facts of group and semigroup theory. An introduction liping liu college of business administration, university of akron, akron, oh 443254801 the notion of belief functions is a result of the seminar work of shafer1 and its conceptual. Dempstershafer theory, introduced and developed by dempster and shafer 6,7,8, has many merits by contrast to bayesian probability theory. Combination of evidence in dempstershafer theory unt.
Therefore, how to determine the weights of individual classifier in order to get more accurate results becomes a question need. This research focuses on dempstershafers evidence theory and the different similarity measures used to. Shafer theory to combine the results obtained from individual sources to find a final unified ranking. The significant innovation of this framework is that it allows for the allocation of a probability mass to sets or intervals. Timedomain data fusion using weighted evidence and dempster. A modified combination rule in generalized evidence theory.
The dempstershafer theory is a natural, important and useful extension of classical probability theory. In this paper, a new weighted evidence combination on the basis of the distance between evidence and entropy function is presented. Paradox elimination in dempstershafer combination rule. These indices are used to code the process of reasoning under uncertainty the combination of evidenceusing the dempstershafer theory. Dempstershafer is a theory of uncertainty that helps to quantify the degree to which some source of evidence supports a particular. A case of combination of evidence in the dempstershafer theory. Dempsters rule of combination can only be used when the bodies of evidence are assumed to be independent. The initial work introducing dempstershafer ds theory is found in dempster 1967 and shafer 1976. The dempster shafer theory is a mathematical theory of evidence, which allows one to combine evidences from different sources and arrive at a belief function by taking into account all the available evidences. Updating the evidence in the dempstershafer theory deepdyve.
The dempstershafer theory of evidence jean gordon and edward h. Sentiment prediction based on dempstershafer theory of. Download a mathematical theory of evidence or read online books in pdf, epub, tuebl, and mobi format. A flexible rule for evidential combination in dempstershafer.
Get addresses conflict management in an open world, where the. This theory offers an elegant theoretical framework for modeling uncertainty, and provides a method for combining distinct bodies of evidence collected. A study of dempstershafers theory of evidence in comparison. A new technique for combining multiple classifiers using the. This report surveys a number of possible combination rules for dempstershafer structures and provides examples of the. A case of combination of evidence in the dempstershafer. Dempsters rule of combination is sometimes interpreted as an approximate generalisation of bayes rule. A new technique for combining multiple classifiers using. Evidence combination dempstershafer theory provides a method to combine the previous measures of evidence of different sources. In this paper a special case of combination of two bodies of evidence with nonzero conflict coefficient is considered. Nov 25, 2014 dempster s rule of combination can only be used when the bodies of evidence are assumed to be independent. Dempstershafer theory, which can be regarded as a generalisation of probability theory, is a widely used formalism for reasoning with uncertain information. Dempsters combination rule in dempstershafer theory of evidence is widely used to combine multiple pieces of evidence. Classic works of the dempstershafer theory of belief functions.
A study of dempstershafers theory of evidence in comparison to classical probability combination scott j. Exploring the combination of dempstershafer theory and. Shafer combination creates a desired synergy between 2 bodies of knowledge, which improves the precision of the top. Weighted evidence combination based on distance of. This is a potentially valuable tool for the evaluation of risk and reliability in engineering applications when it is not possible to obtain a precise measurement from experiments, or when knowledge is obtained. Paradoxes source of conflicts in ds combination rule.
There is, however, a simple way of approach ing the dempster shafer theory that only requires a min. Theory of evidence and its implication for the rule of combination. By bridging fuzzy logic and probabilistic reasoning, the theory of belief functions. To each answer, the probability that it must be true is denoted as bel and the probability that it cannot be false is denoted as pl. Click download or read online button to get a mathematical theory of evidence book now. A flexible rule for evidential combination in dempster. Simulation results showed that this method is successful in capturing the changes dynamic behavior in timedomain object classification. On the independence requirement in dempstershafer theory. The application of dempstershafer theory demonstrated with justi.
An introduction liping liu college of business administration, university of akron, akron, oh 443254801 the notion of belief functions is a result of the seminar work of shafer1 and its conceptual forerunnerlower and upper probabilities. The dempstershafer theory of evidence is a formalism, which allows appropriate interpretation of extractors con. Application of dempster shafer theory to the in silico prediction of chemical toxicity based on qsar models and rulebased structural alerts demonstrates the advantages of this approach. Combining classifiers using the dempster shafer theory of. The 8step algorithm is applied to timedomain to achieve the sequential combination of timedomain data. As a tool to manipulate an uncertain environment, ds evidence theory established a rounded system for uncertainty management and information fusion 3,4,5,6.
On the dempstershafer framework and new combination rules. First, the weight is determined based on the distance of evidence. A simple view of the dempstershafer theory of evidence and. Bell school of electronics, electrical engineering and computer science queens university belfast belfast bt7 1nn, uk fj. The application of dempstershafer theory demonstrated with. To apply data fusion in timedomain based on dempstershafer ds combination rule, an 8step algorithm with novel entropy function is proposed. The proposed approach is identified as two procedures. Section 5 investigates the semigroup structure of dempstershafer and states the main results relating it to bayes. This research focuses on dempstershafers evidence theory and the different similarity measures used to compare two separate bodies of evidence boes. In order to solve the above problems, this paper puts forward a mass collaborationdriven method for recommending product ideas based on dempstershafer theory of evidence dst, on the basis of taking full consideration of the characteristics of the large number of ideas and the large number of participants. Combining multiple query interface matchers using dempstershafer theory of evidence jun hong, zhongtian he and david a. Ds is a mathematical theory of evidence based on belief functions and plausible. As a more flexible mathematical tool, dempstershafer theory not only combines with other mathematical frameworks 1518, but also combines with.
A method of multiclassifier combination based on dempster. An important aspect of this theory is the combination of evidence obtained from multiple sources and the modeling of conflict between them. Sentiment prediction based on dempstershafer theory of evidence. The paper presents an algorithm for translating the subontologies containing con. 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. The dempster shafer theory of evidence is a powerful method for combining measures of evidence from different classifiers. Section 5 investigates the semigroup structure of dempster shafer and states the main results relating it to bayes. An important aspect of this theory is the combination of evidence obtained from. Combining multiple query interface matchers using dempster. The dempstershafer theory is a mathematical theory of evidence, which allows one to combine evidences from different sources and arrive at a belief function by taking into account all the available evidences. Bel is also marked as bpa basic probability assignment or mass function m. Special issue on the dempstershafer theory of evidence.
A simple view of the dempstershafer theory of evidence and its implication for the rule of combination lotfi a. Paradox elimination in dempstershafer combination rule with. Timedomain data fusion using weighted evidence and. The algorithm allows to carry out the reasoning with updating the evidence in much more efficient way than using the original. This report surveys a number of possible combination rules for dempstershafer structures and provides examples of the implementation of these rules for discrete and intervalvalued data. Alani a, deriche m 2002 a new technique for combining multiple classifiers using the dempstershafer theory of evidence. In this section, we first present a brief description of dempster shafer ds theory and then describe the way in which we apply it to the score aggregation problem. Combination of evidence in dempstershafer theory core. This site is like a library, use search box in the widget to get ebook that you want. Jeffreylike rules of conditioning for the dempstershafer theory of. Dempstershafer theory dst, also known as the theory of evidence or the theory of belief functions, was introduced by shafer in 1976 1 based on dempsters previous works 2, 3, 4. This report surveys a number of possible combination rules for dempster shafer structures and provides examples of the implementation of these rules for discrete and intervalvalued data.
Dempstershafer evidence combination rule generalization of equation eq. This paper presents a new classifier combination technique based on the dempster shafer theory of evidence. Using the dempstershafer theory of evidence to resolve. The application of the theory hinges on the use of a rule for combining evidence from different sources. Handling of dependence in dempstershafer theory su. There is no good practice that can be generally accepted until the presence of generalized evidence theory get. Handling of dependence in dempstershafer theory su 2015.
However, to use ds sensor fusion algorithm for robust application, we have to. Shafers book contains a wealth of significant results, and is a must for anyone who wants to do serious research on problems relating to the rules of combination of evidence in expert systems. A mathematical theory of evidence download ebook pdf, epub. Conflict management is an open issue in dempster shafer evidence theory. Oct 20, 2016 dempster shafer evidence theory is an efficient tool used in knowledge reasoning and decisionmaking under uncertain environments. Since its introduction the very name causes confusion, a more general term often used is belief functions both used intermittently here. The disjunctive rule of combination and the generalized bayesian theorem. Particularly appealing is the mathematical theory of evidence developed by arthur dempster. As a tool to manipulate an uncertain environment, dempstershafer ds evidence theory is an established system for uncertainty management 4,5.
Nguyen 1978 points out, soon after its introduction, t. Modified dempstershafer ds evidence theory can handle. The goal of the combination of imperfect information is to nd an accurate information, easily interpretable, which can resume the information set to be combined. Gordon and others published the dempstershafer theory of evidence find, read and cite all the research you. Dempstershafer evidence theory is an efficient tool used in knowledge reasoning and decisionmaking under uncertain environments. The dempster shafer theory of evidence jean gordon and edward h. This paper proposes a systematic approach to handle dependence in evidence theory. Apr 01, 2002 an important aspect of this theory is the combination of evidence obtained from multiple sources and the modeling of conflict between them. Get addresses conflict management in an open world, where the frame of. Pdf implementing dempsters rule for hierarchical evidence.
In this section, we first present a brief description of dempstershafer ds theory and then describe the way in which we apply it to the score aggregation problem. It is shown that application of the dempstershafer rule of combination in this case leads to an evaluation of masses of the combined bodies that is. On the behavior of dempsters rule of combination and the. Expert systemsdempstershafer theory wikibooks, open books. The theory of belief functions, also referred to as evidence theory or dempstershafer theory dst, is a general framework for reasoning with uncertainty, with understood connections to other frameworks such as probability, possibility and imprecise probability theories. Zadeh compufer science division, universify of california, berkeley, california 94720 the emergence of expert systems as one of the major ar. Seims this thesis is an assessment on the effectiveness of dempstershafers theory of evidence in comparison to classical probabilistic combination as it applies to synthetic aperture radar sar automatic target recognition atr.
A problem is aroused in multiclassifier system that normally each of the classifiers is considered equally important in evidences combination, which gone against with the knowledge that different classifier has various performance due to diversity of classifiers. Dempstershafer theory ds theory, also called belief function theory, as introduced and developed by dempster and shafer 1,2, has emerged from their works on statistical inference and uncertain reasoning. Dempstershafer theory for combining in silico evidence. All the bpas of a same question will constitute a ds evidence.
A mathematical theory of evidence download ebook pdf. Dempster shafer theory, which can be regarded as a generalisation of probability theory, is a widely used formalism for reasoning with uncertain information. Dempstershafer theory for combining in silico evidence and. Conflict management is an open issue in dempstershafer evidence theory. If is the basic probability assignment provided by source, the combination. Dempster shafer theory does not require an assumption regarding the probability of the individual constituents of the set or interval. The dempstershafer theory of evidence is a powerful method for combining measures of evidence from different classifiers. The application of dempstershafer theory demonstrated. Dempster shafer is a theory of uncertainty that helps to quantify the degree to which some source of evidence supports a particular. In this work we have proposed three novel algorithms to combine different biometric systems using the dst.
This theory may be considered as a generalization of the probability theory. It sho wn that application of the dempstershafer rule com bination. This paper presents a new classifier combination technique based on the dempstershafer theory of evidence. Application of dempstershafer theory to the in silico prediction of chemical toxicity based on qsar models and rulebased structural alerts demonstrates the advantages of this approach. Data classification using the dempstershafer method arxiv. Dempstershafer theory, data classification, dempsters rule of combination. Dempstershafer theory does not require an assumption regarding the probability of the individual constituents of the set or interval. Dempstershafer ds theory 1 is an effective tool to make a decision from several answers with ambiguity. Mass collaborationdriven method for recommending product. The limitations of the original ds combination rule and works to eliminate them are discussed in section 4.
The dempster shafer theory of evidence accumulation is one of the main tools for combining data obtained from multiple sources. However, when the evidence is severely conflicting, the result could be counterintuitive. On the independence requirement in dempstershafer theory for. It sho wn that application of the dempstershafer rule com bination in this case leads to ev aluation of masses. A simple view of the dempstershafer theory of evidence. Pdf combination of evidence in dempstershafer theory. In this context the dempster shafer theory of evidence dst has shown some promising results. The dempster shafer theory is a mathematical theory of evidence based on belief functions and plausible reasoning, which is used to combine separate pieces of information evidence to calculate the probability of an event. To develop an adequate understanding of this theory re quires considerable effort and a good background in proba bility theory. It is shown that application of the dempstershafer rule of combination in this case leads to an evaluation of masses of the combined. The theory of belief functions, also referred to as evidence theory or dempster shafer theory. A simple view of the dempstershafer theory of evidence and its. Pdf the dempstershafer theory of evidence researchgate. Conflict management in dempster shafer theory ds theory is a hot topic in information fusion.
501 233 16 1401 148 715 1250 1297 476 1479 8 1284 1091 685 57 482 1466 1159 1440 1455 428 1034 1480 1350 1482 1066 388 1008 1183 721 992 138 473 1378 363 780 1455 453 1271 1067 208 1394