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.
β¦ LIBER β¦
Computing beliefs
β Scribed by Aleksander, Igor
- Book ID
- 109780860
- Publisher
- Nature Publishing Group
- Year
- 1992
- Tongue
- English
- Weight
- 275 KB
- Volume
- 357
- Category
- Article
- ISSN
- 0028-0836
- DOI
- 10.1038/357549a0
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Implementing belief function computation
β
Rolf Haenni; Norbert Lehmann
π
Article
π
2003
π
John Wiley and Sons
π
English
β 168 KB
A computational model of belief
β
Aaron N. Kaplan; Lenhart K. Schubert
π
Article
π
2000
π
Elsevier Science
π
English
β 322 KB
We propose a logic of belief in which the expansion of beliefs beyond what has been explicitly learned is modeled as a finite computational process. The logic does not impose a particular computational mechanism; rather, the mechanism is a parameter of the logic, and we show that as long as the mech
Teachersβ beliefs about instructional co
β
Nancy Nelson Knupfer
π
Article
π
1988
π
Springer-Verlag
β 875 KB
Local computation of Gaussian belief fun
β
Liping Liu
π
Article
π
1999
π
Elsevier Science
π
English
β 270 KB
High school computing teachers' beliefs
β
Kordaki, Maria
π
Article
π
2013
π
Elsevier Science
π
English
β 280 KB
Rational Beliefs as Produced by Computat
β
Witold Marciszewski
π
Article
π
1997
π
Springer
π
English
β 906 KB