Dempster-Shafer Theory of Evidence
Dempster-Shafer Theory of Evidence (Belief Functions) · Also known as: evidence theory, belief functions, evidential reasoning, Dempster-Shafer kanıt teorisi
Dempster-Shafer theory is a mathematical framework for reasoning under uncertainty that generalizes Bayesian probability by representing ignorance explicitly. Instead of forcing a single probability on each hypothesis, it assigns belief mass to sets of hypotheses and derives a belief-plausibility interval, and it provides Dempster's rule for fusing evidence from multiple independent sources. Developed from Arthur Dempster's 1967 work and Glenn Shafer's 1976 monograph, it underpins evidential reasoning and sensor/decision fusion.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
When to use it
Use Dempster-Shafer theory when you must combine uncertain, partial, or conflicting evidence from multiple sources and want to represent ignorance explicitly rather than assume a full prior — typical in sensor fusion, multi-source classification, diagnostic and target-recognition systems, risk and reliability assessment, and GIS evidence overlay. It is valuable when assigning precise Bayesian priors is artificial and when distinguishing 'no evidence' from 'evidence of no' matters. Caveats: Dempster's rule can produce counter-intuitive results under highly conflicting sources (Zadeh's paradox), computation grows with the power set of hypotheses, and the independence assumption between sources is often only approximate. Alternatives/extensions include Bayesian networks, the transferable belief model, and other conflict-tolerant combination rules.
Strengths & limitations
- Represents ignorance explicitly via mass on sets, not forced single probabilities.
- Provides belief and plausibility bounds that quantify how much is unknown.
- Offers a principled rule for fusing evidence from multiple independent sources.
- Generalizes Bayesian probability, recovering it when all mass is on singletons.
- Dempster's rule can give counter-intuitive results under high conflict (Zadeh's paradox).
- Computation scales with the power set of the frame, costly for many hypotheses.
- Assumes sources are independent, which is often only approximately true.
- Eliciting meaningful mass functions can be difficult in practice.
Frequently asked
How does Dempster-Shafer differ from Bayesian probability?
Bayesian probability assigns a single number to each hypothesis and requires a full prior. Dempster-Shafer assigns mass to sets of hypotheses, letting it represent ignorance directly, and summarizes each hypothesis by a belief-plausibility interval. It generalizes the Bayesian approach, which is recovered when all mass sits on individual hypotheses.
What are belief and plausibility?
Belief Bel(A) is the total evidence that fully commits to A (a lower bound on its probability); plausibility Pl(A) is the total evidence merely compatible with A (an upper bound). The interval [Bel(A), Pl(A)] brackets the true support for A, and its width reflects how much remains unknown.
What is the conflict problem in Dempster's rule?
When two sources strongly disagree, most of the combined mass falls on the empty set (the conflict K). Normalizing it away can yield counter-intuitive results — Zadeh's classic paradox. High conflict signals that Dempster's rule may be inappropriate, motivating alternative combination rules or a review of source reliability.
Sources
- Dempster, A. P. (1967). Upper and lower probabilities induced by a multivalued mapping. The Annals of Mathematical Statistics, 38(2), 325–339. DOI: 10.1214/aoms/1177698950 ↗
- Shafer, G. (1976). A Mathematical Theory of Evidence. Princeton University Press. ISBN: 978-0-691-08175-5
How to cite this page
ScholarGate. (2026, June 2). Dempster-Shafer Theory of Evidence (Belief Functions). ScholarGate. https://scholargate.app/en/soft-computing/dempster-shafer-theory
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Bayesian NetworkBayesian↔ compare
- Case-Based ReasoningSoft Computing↔ compare
- Fuzzy Cognitive MapsSoft Computing↔ compare
- Naive BayesMachine learning↔ compare