Title of article
The Dempster–Shafer calculus for statisticians Original Research Article
Author/Authors
A.P. Dempster، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
13
From page
365
To page
377
Abstract
The Dempster–Shafer (DS) theory of probabilistic reasoning is presented in terms of a semantics whereby every meaningful formal assertion is associated with a triple (p, q, r) where p is the probability “for” the assertion, q is the probability “against” the assertion, and r is the probability of “don’t know”. Arguments are presented for the necessity of “don’t know”. Elements of the calculus are sketched, including the extension of a DS model from a margin to a full state space, and DS combination of independent DS uncertainty assessments on the full space. The methodology is applied to inference and prediction from Poisson counts, including an introduction to the use of join-tree model structure to simplify and shorten computation. The relation of DS theory to statistical significance testing is elaborated, introducing along the way the new concept of “dull” null hypothesis.
Keywords
Dempster–Shafer , Belief functions , Join-tree computation , State space , Dull null hypothesis , Statistical significance , Poisson model
Journal title
International Journal of Approximate Reasoning
Serial Year
2008
Journal title
International Journal of Approximate Reasoning
Record number
1182496
Link To Document