CALCULATING DEMPSTER-SHAFER PLAUSIBILITY

被引:23
作者
BARNETT, JA
机构
[1] Northrop Res & Technol Center,, Palos Verdes Peninsula, CA
关键词
DECISION MAKING; DEMPSTER-SHAFER BELIEF CALCULUS; PLAUSIBILITY CALCULATION; PLAUSIBLE REASONING;
D O I
10.1109/34.87345
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A sufficient condition is developed for the equality of the plausibility and commonality measures of the Dempster-Shafer belief calculus. When the condition is met, as it is in many applications, 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 counterindicate its use.
引用
收藏
页码:599 / 602
页数:4
相关论文
共 8 条
[1]  
Barnett J. A., 1981, P 7 INT JOINT C ART, P868
[2]   A METHOD FOR MANAGING EVIDENTIAL REASONING IN A HIERARCHICAL HYPOTHESIS SPACE [J].
GORDON, J ;
SHORTLIFFE, EH .
ARTIFICIAL INTELLIGENCE, 1985, 26 (03) :323-357
[3]   A STATISTICAL VIEWPOINT ON THE THEORY OF EVIDENCE [J].
HUMMEL, RA ;
LANDY, MS .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1988, 10 (02) :235-247
[4]   DEMPSTER RULE OF COMBINATION IS =P-COMPLETE [J].
ORPONEN, P .
ARTIFICIAL INTELLIGENCE, 1990, 44 (1-2) :245-253
[5]   ARTIFICIAL-INTELLIGENCE DIALECTS OF THE BAYESIAN BELIEF REVISION LANGUAGE [J].
SCHOCKEN, S ;
KLEINDORFER, PR .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1989, 19 (05) :1106-1121
[6]   IMPLEMENTING DEMPSTER RULE FOR HIERARCHICAL EVIDENCE [J].
SHAFER, G ;
LOGAN, R .
ARTIFICIAL INTELLIGENCE, 1987, 33 (03) :271-298
[7]  
Shafer G., 1976, MATH THEORY EVIDENCE, DOI 10.1515/9780691214696
[8]  
Tarski A., 1969, LOGIC SEMANTICS META