ON THE JUSTIFICATION OF DEMPSTER RULE OF COMBINATION

被引：115

作者：

VOORBRAAK, F

机构：

[1] Department of Philosophy, University of Utrecht, 3584 CS Utrecht

来源：

ARTIFICIAL INTELLIGENCE | 1991年 / 48卷 / 02期

关键词：

D O I：

10.1016/0004-3702(91)90060-W

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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. Shafter'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.

引用

页码：171 / 197

页数：27

共 16 条

[1]

COHEN MS, 1985, 851 DEC SCI CONS TEC

[2] UPPER AND LOWER PROBABILITIES INDUCED BY A MULTIVALUED MAPPING [J].

DEMPSTER, AP .

ANNALS OF MATHEMATICAL STATISTICS, 1967, 38 (02) :325-&

[3]

Fishburn P. C., 1986, STAT SCI, V1, P335

[4]

GORDON J, 1984, RULE BASED EXPERT SY, P272

[5]

KANAL LN, 1986, UNCERTAINTY ARTIFICI

[6] BAYESIAN AND NON-BAYESIAN EVIDENTIAL UPDATING [J].

KYBURG, HE .

ARTIFICIAL INTELLIGENCE, 1987, 31 (03) :271-293

[7]

KYBURG HE, 1987, LECT NOTES COMPUT SC, V286, P30

[8]

LEMMER JF, 1986, UNCERTAINTY ARTIFICI, P117

[9]

LINDLEY DV, 1987, STAT SCI, V2, P17, DOI DOI 10.1214/SS/1177013427

[10] CONSTRUCTIVE PROBABILITY [J].

SHAFER, G .

SYNTHESE, 1981, 48 (01) :1-60

← 1 2 →