Algorithmic Modifications to the Theory of Evidential Reasoning
β Scribed by E.T. Kofler; C.T. Leondes
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 324 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0196-6774
No coin nor oath required. For personal study only.
β¦ Synopsis
Important modifications to the theory of evidential reasoning (Dempster-Shafer theory) are presented. By relaxing the requirement that basic probability mass assignments have unity norm and by omitting the normalization step in Dempster's rule of combination the algorithm is improved. A detailed comparison with the original theory is made and formal results are proved. Applicability of the modifications is examined and some cautionary notes are given. 1994 Academic Press, inc.
π SIMILAR VOLUMES
This work investigates the problem of combining deficient evidence for the purpose of quality assessment. The main focus of the work is modeling vagueness, ambiguity, and local nonspecificity in information within a unified approach. We introduce an extended fuzzy Dempster-Shafer scheme based on the