On the justification of Dempster's rule of combination
Artificial IntelligencePublished 1 March 1991
Frans Voorbraak
Citations205
SJR quartileQ1
SJR score1.84
SNIP3.30
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
In Dempster-Shafer theory it is claimed that the pooling of evidence is reflected by Dempster's rule of combination, provided certain requirements are met. The justification of this claim is problematic, since the existing formulations of the requirements for the use of Dempster's rule are not completely clear. In this paper, randomly coded messages, Shafer's canonical examples for Dempster-Shafer theory, are employed to clarify these requirements and to evaluate Dempster's rule. The range of applicability of Dempster-Shafer theory will turn out to be rather limited. Further, it will be argued that the mentioned requirements do not guarantee the validity of the rule and some possible additional conditions will be described.
Keywords
Computer ScienceEngineering
The Annals of Mathematical StatisticsUpper and Lower Probabilities Induced by a Multivalued Mapping
5,972 Citations1967A. P. Dempster
Studies in fuzziness and soft computingUpper and Lower Probabilities Induced by a Multivalued Mapping
5,299 Citations2008Arthur P. Dempster
A distinctive feature of the present approach is a rule for conditioning, or more generally, arule for combining sources of information, as discussed in Sects.
AI MagazineA simple view of the Dempster-Shafer theory of evidence and its implication for the rule of combination
795 Citations1986Lotfi A. Zadeh
This paper presents a meta-analyses of the determinants of earthquake-triggered landsliding in Chile over a period of 12 months in the period of May 21 to 29, 1986 and the results show clear patterns in the number of landsliding events and their intensity.
Artificial IntelligenceBayesian and non-bayesian evidential updating
314 Citations1987Henry E. Kyburg
The impact of “uncertain evidence” can be (formally) represented by Dempster conditioning, in Shafer's framework, in the framework of convex sets of classical probabilities by classical conditionalization.
Statistical ScienceThe Probability Approach to the Treatment of Uncertainty in Artificial Intelligence and Expert Systems
195 Citations1987D. V. Lindley
Arguments are adduced to support the claim that the only satis- factory description of uncertainty is probability, and a challenge is made that anything that can be done by alternative methods for handling uncertainty can be do better by probability.
International Journal of Man-Machine StudiesA computationally efficient approximation of Dempster-Shafer theory
172 Citations1989Frans Voorbraak
A Bayesian approximation of a belief function is defined and it is shown that combining the Bayesian approximations of belief functions is computationally less involving than combining the belief functions themselves.
Morgan Kaufmann Publishers Inc. eBooksThe Dempster-Shafer theory of evidence
164 Citations1990Jill Gordon, Edward H. Shortliffe
The advantage of the Dempster-Shafer theory over previous approaches is its ability to model the narrowing of the hypothesis set with the accumulation of evidence, a process that characterizes diagnostic reasoning in medicine and expert reasoning in general.
Machine intelligence and pattern recognitionProbability Judgment in Artificial Intelligence
50 Citations1986
This paper is concerned with two theories of probability judgment: the Bayesian theory and the theory of belief functions and illustrates these theories with some simple examples and discusses some of the issues that arise when the authors try to implement them in expert systems.
Machine intelligence and pattern recognitionConfidence Factors, Empiricism and the Dempster-Shafer Theory of Evidence
41 Citations1986John F. Lemmer
The need for an empirical interpretation of any theory of confidence factors applied to Knowledge Based Systems is discussed and an empirical interpretations of Dempster-Shafer (DS) theory is described suggesting that the theory-has been seriously misinterpreted.
A computationally efficient approximation of Dempster-Shafer theory
30 Citations1990Frans Voorbraak
Annals of Pure and Applied LogicA course on bimodal provability logic
19 Citations1995Albert Visser
The aim of the present paper is to give a decent model- & frame-theory for modal logic of subsystems of Peano Arithmetic whose axiom sets are bounded by non-standard numbers and the Arithmetical Completeness Theorem for these systems can be applied to characterize which formulas of the language of ordinary, 'unimodal', provability logic are E1.
Lecture notes in computer scienceRepresenting knowledge and evidence for decision
7 Citations1987Henry E. Kyburg
It is argued that point-valued probabilities are a poor representation of uncertainty, that the authors need not be concerned with uncertain evidence, and that this framework provides a very nearly classical decision theory— so far as it goes.
Defense Technical Information Center (DTIC)Alternative Theories of Inference in Expert Systems for Image Analysis.
4 Citations1985Marvin S. Cohen, Steven James Watson +1 more
The top-level design of a new system, the Non-Monotonic Probabilist (NMP), is developed, which takes into account the actual practice of expert statisticians in probabilistic reasoning.