The canonical decomposition of a weighted belief
作者： Philippe Smets
DOI:
关键词:
摘要: Any belief function can be decomposed into a confidence and diffidence components. Each components is uniquely decomposable simple support functions that represent the impact of simplest form evidence, one only partially supports given subset frame discernment. The nature inverse Dempster's rule combination detailed. component translates 'good reasons to believe'. It classically considered when constructing belief. not
ijcai.org参考文章(7)
Prakash P. Shenoy, Conditional independence in valuation-based systems International Journal of Approximate Reasoning. ,vol. 10, pp. 203- 234 ,(1994) , 10.1016/0888-613X(94)90001-9
P. Smets, The combination of evidence in the transferable belief model IEEE Transactions on Pattern Analysis and Machine Intelligence. ,vol. 12, pp. 447- 458 ,(1990) , 10.1109/34.55104
Nikhil R. Pal, James C. Bezdek, Rohan Hemasinha, Uncertainty measures for evidential reasoning I: A review☆ International Journal of Approximate Reasoning. ,vol. 7, pp. 165- 183 ,(1992) , 10.1016/0888-613X(92)90009-O
Ph Smets, Y Hsia, Alessandro Saffiotti, Robert Kennes, H Xu, E Umkehrer, The transferable belief model Artificial Intelligence. ,vol. 66, pp. 191- 234 ,(1994) , 10.1016/0004-3702(94)90026-4
R. Kennes, Computational aspects of the Mobius transformation of graphs systems man and cybernetics. ,vol. 22, pp. 201- 223 ,(1992) , 10.1109/21.148425
Arthur P. Dempster, Upper and Lower Probabilities Induced by a Multivalued Mapping Classic Works of the Dempster-Shafer Theory of Belief Functions. ,vol. 38, pp. 57- 72 ,(1967) , 10.1007/978-3-540-44792-4_3
Glenn Shafer, A mathematical theory of evidence ,(1976)