loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Calculating Dempster-Shafer Plausibility
June 1991 (vol. 13 no. 6)
pp. 599-602
ASCII Text
x 
 
J.A. Barnett, "Calculating Dempster-Shafer Plausibility," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 13, no. 6, pp. 599-602, June, 1991.
 
 
BibTex
x
 
@article{ 10.1109/34.87345,
author = {J.A. Barnett},
title = {Calculating Dempster-Shafer Plausibility},
journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence},
volume = {13},
number = {6},
issn = {0162-8828},
year = {1991},
pages = {599-602},
doi = {http://doi.ieeecomputersociety.org/10.1109/34.87345},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Pattern Analysis and Machine Intelligence
TI - Calculating Dempster-Shafer Plausibility
IS - 6
SN - 0162-8828
SP599
EP602
EPD - 599-602
A1 - J.A. Barnett,
PY - 1991
KW - plausible reasoning; decision theory; probability; Dempster-Shafer; plausibility; sufficient condition; equality; belief calculus; choice; calculus; decision theory; inference mechanisms; probability
VL - 13
JA - IEEE Transactions on Pattern Analysis and Machine Intelligence
ER -
 

A sufficient condition for the equality of the plausibility and commonality measures of the Dempster-Shafer belief calculus is developed. When the condition is met, an efficient method to calculate relative plausibility is available. In particular, the method can be used to calculate the relative plausibility of atomic hypotheses and, therefore, it can be used to find the choice that maximizes this measure. The computation is efficient enough to make Dempster-Shafer practical in some domains where computational complexity would otherwise discourage its use.

[1] J. A. Barnett, "Computational methods for a mathematical theory of evidence," inProc. IJCAI-81, Vancouver, B.C., Canada, 1981, pp. 868-875.
[2] J. Gordon and E.H. Shortliffe, "A method for managing evidential reasoning in a hierarchical hypothesis space,"Artificial Intell., vol. 26, pp. 323-357, 1985.
[3] R.A. Hummel and M.S. Landy, "A statistical viewpoint on the theory of evidence,"IEEE Trans. Pattern Anal. Machine Intell., vol. 10, pp. 235-247, 1988.
[4] P. Orponen, "Dempster's rule of combination is #P-complete,"Artificial Intell., vol. 44, pp. 245-253, 1990.
[5] S. Schocken and P.R. Rleindorfer, "Artificial intelligence dialects of the Bayesian belief revision language,"IEEE Trans. Syst. Man Cybern., vol. 19, pp. 1106-1121, 1989.
[6] G. Shafer and R. Logan, "Implementing Dempster's rule for hierarchical evidence,"Artificial Intell., vol. 33, pp. 271-298, 1987.
[7] G. Shafer,A Mathematical Theory of Evidence. Princeton, NJ: Princeton University Press, 1976.
[8] A. Tarski, "On the foundations of Boolean algebra," inLogic, Semantics, Meta-Mathematics, J. H. Woodger, Tr. New York: Clarendon Press, Oxford, 1969.

Index Terms:
plausible reasoning; decision theory; probability; Dempster-Shafer; plausibility; sufficient condition; equality; belief calculus; choice; calculus; decision theory; inference mechanisms; probability
Citation:
J.A. Barnett, "Calculating Dempster-Shafer Plausibility," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 13, no. 6, pp. 599-602, June 1991, doi:10.1109/34.87345
Usage of this product signifies your acceptance of the Terms of Use.