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

Soft Computing

Volumn 7, Issue 5, 2003, Pages 288-296

  Daniel, M ^a  

^a INSTITUTE OF COMPUTER SCIENCE   (Czech Republic)

Author keywords

Belief function; Conflict; Contradiction; Dempster Shafer theory; MinC combination

Indexed keywords

BELIEF FUNCTION; CONFLICT; CONTRADICTION; DEMPSTER-SHAFER THEORY; MINC COMBINATION;

SOFT COMPUTING; SOFTWARE ENGINEERING;

UNCERTAINTY ANALYSIS;

EID: 26944442945     PISSN: 14327643     EISSN: 14337479     Source Type: Journal    
DOI: 10.1007/s00500-002-0215-5     Document Type: Article

References (18)

1. Besnard P, Jaouen P, Perin J-Ph (1996) Extending the transferable belief model for inconsistency handling. In: Proceedings IPMU'96, Information Processing and Management of Uncertainty in Knowledge-Based Systems, pp. 143-148, Granada
2. Milan Daniel (1995) Algebraic structures related to Dempster-Shafer theory. In: Bernadette Bouchon-Meunier, Ronal R. Yager, Lotfi A. Zadeh, (eds) Advances in Intelligent Computing-IPMU'94; Lecture Notes in Computer Science 945, pp. 51-61, Paris, France, Springer-Verlag
3. Milan Daniel (2000) Distribution of contradictive belief masses in combination of belief functions. In: Bernadette Bouchon-Meunier, Ronal R. Yager, Lotfi A. Zadeh, (eds) Information, Uncertainty and Fusion, pp. 431-446. Kluwer Academic Publishers
4. Milan Daniel (1999) Looking for an associative combination of belief functions. Technical Report V-790, ICS AS CR, Prague
5. Milan Daniel (2000) Associativity and contradiction in combination of belief functions. In: Proceedings Eighth Internetional conference IPMU, Universidad Politecnica de Madrid, 2000, Vol. I., pp. 133-140
6. Petr Hájek, Tomáš Havránek, Radim Jiroušek (1992) Uncertain information processing in expert systems. CRC Press, Boca Raton, Florida
7. Petr Hájek, Julio J. Valdés (1991) Generalized algebraic foundations of uncertainty processing in rule-based expert systems (dempsteroids). Computers and Artificial Intelligence 10: 29-42
8. David Harmanec (1999) Faithful approximation of belief functions. In: Lashey KB, Prade H (eds) Uncertainty in Artificial Intelligence (proceedings of the Fifteenth Conference) 271-278
9. Ivan Kramosil (1998) Probabilistic analysis of Dempster combination rule. In: Childers T (ed) The Yearbook LOGICA 1997, 175-187 Filosofia, Prague
10. Ivan Kramosil (2001) Probabilistic analysis of belief functions. 214p. Kluwer, New York
11. Quan Pan, Shanying Zhang, Hongcai Zhang Some research on conflict and robustness of evidence theory. (in print).
12. Glen Shafer (1976) A mathematical theory of evidence. Princeton University Press, Princeton, New Jersey
13. Philippe Smets (1990) The combination of evidence in the transferable belief model. IEEE-Pattern analysis and Machine Intelligence 12: 447-458
14. Philippe Smets, Robert Kennes (1994) The transferable belief model. Artificial Intelligence 66: 191-234
15. Phillipe Smets (1995) The canonical decomposition of a weighted belief. In IJCAI-95-Proceedings of the 14th International Joint Conference on Artificial Intelligence, pp. 1896-1901, Montréal, Québec, Canada
16. Philippe Smets (1997) The a-junctions: Combination operators applicable to belief functions. In: Gabbay D, Nonnengart A, Ohlbach HJ (eds) Qualitative and quantitative practical reasoning, pp. 131-153. Springer, Berlin
17. Ronal R. Yager (1987) On the D-S framework and new combination rules. Information Sciences 41: 93-138
18. Milan Daniel (2001) Composition and Decomposition of Belief Functions. In: Jiroušek R and Vejnarová J (eds.), Proc. of 4th Czech-Japan Seminar on Data Analysis and Decision Making under Uncertainty, Jindřrichu°v Hradec, pp. 21-32