𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Measures of discord in the Dempster-Shafer theory

✍ Scribed by Arthur Ramer; George Klir

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
872 KB
Volume
67
Category
Article
ISSN
0020-0255

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A computationally efficient approximatio
A computationally efficient approximation of Dempster-Shafer theory
✍ Frans Voorbraak πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science βš– 671 KB

An often mentioned obstacle for the use of Dempster-Shafer theory for the handling of uncertainty in expert systems is the computational complexity of the theory. One cause of this complexity is the fact that in Dempster-Shafer theory the evidence is represented by a belief function which is induced

Special issue on the dempster-shafer the
Special issue on the dempster-shafer theory of evidence: an introduction
✍ Liping Liu πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 44 KB πŸ‘ 1 views

The notion of belief functions is a result of the seminar work of Shafer 1 and its conceptual forerunner-lower and upper probabilities. 2,3 In recent years, we saw a surge of interest in advancing this theory, developing efficient computation algorithms, and applying it to a wide range of business a

On modal logic interpretation of Dempste
On modal logic interpretation of Dempster–Shafer theory of evidence
✍ David Harmanec; George J. Klir; Germano Resconi πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 465 KB πŸ‘ 1 views

It fully formulates an interpretation of the Dempster-Shafer theory in terms of the standard semantics of modal logic. It is shown how to represent the basic probability assignment function as well as the commonality function of the Dempster-Shafer theory by modal logic and that this representation