Chun-Hung Tzeng
ABSTRACT
This abstract introduces an axiomatic study on Dempster-Shafer theory of handling uncertainty in AI systems. A Dempster-Shafer belief function, based on probabilities, is intended to measure the degree of support a piece of evidence provides for various propositions in its domain. Dempster's rule provides a method of combining evidence that may justify partial beliefs. Shafer argued that the Bayesian theory is a special case of this theory and that Bayes rule of conditioning is a special case of Dempster's rule of combination. However, the development of evidence models, including Dempster's rule, is based on intuition and lacks the axiomatic foundation of probability theory.
- An axiomatic foundation of Dempster-Shafer theory
Recommendations
Generalization of Dempster–Shafer theory: A complex mass function
AbstractDempster–Shafer evidence theory has been widely used in various fields of applications, because of the flexibility and effectiveness in modeling uncertainties without prior information. However, the existing evidence theory is insufficient to ...
Analyzing a Paradox in Dempster-Shafer Theory
FSKD '08: Proceedings of the 2008 Fifth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 05Zadeh has criticized Dempster-Shafer (D-S) theory with a famous counter-example, where an almost impossible case based on two bodies of evidence produces a certain outcome by Dempster's rule of combination. This paper investigates this intuitive paradox ...
Comments