This paper proposes a new approximation method for Dempster-Shafer belief functions. The method is based on a new concept of incomplete belief potentials. It allows to compute simultaneously lower and upper bounds for belief and plausibility. Furthermore, it can be used for a resource-bounded propag
โฆ LIBER โฆ
Implementing belief function computations
โ Scribed by Rolf Haenni; Norbert Lehmann
- Book ID
- 102279540
- Publisher
- John Wiley and Sons
- Year
- 2003
- Tongue
- English
- Weight
- 168 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0884-8173
No coin nor oath required. For personal study only.
โฆ Synopsis
This article discusses several implementation aspects for Dempster-Shafer belief functions. The main objective is to propose an appropriate representation of mass functions and efficient data structures and algorithms for the two basic operations of combination and marginalization.
๐ SIMILAR VOLUMES
Resource bounded and anytime approximati
โ
Rolf Haenni; Norbert Lehmann
๐
Article
๐
2002
๐
Elsevier Science
๐
English
โ 441 KB
Implementing belief propagation in neura
โ
Aaron P. Shon; Rajesh P.N. Rao
๐
Article
๐
2005
๐
Elsevier Science
๐
English
โ 205 KB
Local computation of Gaussian belief fun
โ
Liping Liu
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 270 KB
Computing beliefs
โ
Aleksander, Igor
๐
Article
๐
1992
๐
Nature Publishing Group
๐
English
โ 275 KB
Monetary unit sampling: a belief-functio
โ
Peter R. Gillett
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 199 KB
Bessel and Airy function computations
โ
Gautschi.
๐
Library
๐
English
โ 46 KB