1996
DOI: 10.1080/03081079608945140
|View full text |Cite
|
Sign up to set email alerts
|

On the Computation of Uncertainty Measure in Dempster-Shafer Theory

Abstract: This is a working paper summarizing results of an ongoing research project whose aim is to uniquely characterize the uncertainty mea sure for the Dempster-Shafer Theory. A set of intuitive axiomatic requirements is pre sented, some of their implications are shown, and the proof is given of the minimality of re cently proposed measure AU among all mea sures satisfying the proposed requirements.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
39
0

Year Published

1997
1997
2015
2015

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 48 publications
(41 citation statements)
references
References 12 publications
(11 reference statements)
1
39
0
Order By: Relevance
“…Here S * − S * is considered as a non-specificity measure; and S * as a conflict measure 3 To use the maximum entropy in applications it is important to consider its calculus. Useful algorithms for computing S * were developed for the DST by Harmanec et al [27], for reachable interval-valued probability distributions by Abellán and Moral [2], and for the theory based on Choquet order-2 capacities (2-monotone measures) by Abellán and Moral [4].…”
Section: A Brief Overview Of Uncertainty Measuresmentioning
confidence: 99%
“…Here S * − S * is considered as a non-specificity measure; and S * as a conflict measure 3 To use the maximum entropy in applications it is important to consider its calculus. Useful algorithms for computing S * were developed for the DST by Harmanec et al [27], for reachable interval-valued probability distributions by Abellán and Moral [2], and for the theory based on Choquet order-2 capacities (2-monotone measures) by Abellán and Moral [4].…”
Section: A Brief Overview Of Uncertainty Measuresmentioning
confidence: 99%
“…This functional can be readily generalized to any given convex set of probability distributions, as shown by Abellán and Moral (2003a). Useful algorithms for computing S * were developed for the DST by Harmanec et al (1996), for reachable interval-valued probability distributions by Abellán and Moral (2003a), and for the theory based on Choquet order-2 capacities (2-monotone measures) by .…”
Section: An Overview Of Uncertainty Measuresmentioning
confidence: 99%
“…Fortunately, a relatively simple algorithm for computing S * in DST was developed and its correctness proven (Meyerowitz et al 1994 andHarmanec et al 1996). It was initially assumed, but not proven, that the use of the algorithm can be extended for computing the upper entropy of any credal set (Klir 2003).…”
Section: Upper Entropymentioning
confidence: 99%