Associativity in combination of belief functions; a derivation of minC combination

被引：39

作者：

Daniel, M ^{[1
]}

机构：

[1] Acad Sci Czech Republic, Inst Comp Sci, CZ-18207 Prague 8, Czech Republic

来源：

SOFT COMPUTING | 2003年 / 7卷 / 05期

关键词：

belief function; dempster-shafer theory; contradiction; conflict; minC combination;

D O I：

10.1007/s00500-002-0215-5

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The nature of a contradiction (conflict) between two belief functions is investigated. Alternative ways of distributing the contradiction among nonempty subsets of frame of discernment are studied. The paper employes a new approach to understanding contradictions and introduces an original notion of potential contradiction. A method of an associative combination of generalized belief functions-minC combination and its derivation-is presented as part of the new approach. A proportionalization of generalized results is suggested as well.

引用

页码：288 / 296

页数：9

共 18 条

[1]

[Anonymous], 2001, PROBABILISTIC ANAL B

[2]

BESNARD P, 1996, P IPMU 96 INF PROC M, P143

[3]

Daniel M, 1995, LECT NOTES COMPUT SC, V945, P51, DOI 10.1007/BFb0035936

[4]

Daniel M, 2000, SPRINGER INT SER ENG, V516, P431

[5]

DANIEL M, 1999, V790 ICS AS CR

[6]

DANIEL M, 2000, P 8 INT C INF PROC M, V1, P133

[7]

DANIEL M, 2001, P 4 CZECH JAP SEM DA, P21

[8]

HAJEK P, 1991, COMPUT ARTIF INTELL, V10, P29

[9]

Hajek P., 1992, Uncertain information processing in expert systems

[10]

Harmanec D, 1999, UNCERTAINTY IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, P271

← 1 2 →