Title
Approximation Of Belief Functions
Abstract
This paper addresses the approximation of belief functions by probability functions where the approximation is based on minimizing the Euclidean distance. First of all, we simplify this optimization problem so it becomes equivalent to a standard problem in linear algebra. For the simplified optimization problem, we provide the analytic solution. Furthermore, we show that for Dempster-Shafer belief the simplified optimization problem is equivalent to the original one.In terms of semantics, we compare the approximation of belief functions to various alternative approaches, e.g. pignistic transformation for Dempster-Shafer belief and Shapley value for fuzzy belief functions. For the later one, we give an example where the approximation method has some obvious statistical advantages.Additionally, for the approximation of additive belief functions, we can provide a semantical justification.
Year
DOI
Venue
2003
10.1142/S021848850300251X
INTERNATIONAL JOURNAL OF UNCERTAINTY FUZZINESS AND KNOWLEDGE-BASED SYSTEMS
Keywords
Field
DocType
belief functions, Dempster-Shafer theory, evidence reasoning, pignistic transformation, probability theory, theory of evidence, additive belief functions, uncertain reasoning, Shapley value
Discrete mathematics,Linear algebra,Shapley value,Euclidean distance,Fuzzy logic,Probability theory,Dempster–Shafer theory,Optimization problem,Semantics,Mathematics
Journal
Volume
Issue
ISSN
11
6
0218-4885
Citations 
PageRank 
References 
3
0.41
6
Authors
1
Name
Order
Citations
PageRank
Thomas Weiler130.74