A Monte Carlo Algorithm for Combining Dempster-Shafer Belief Based on Approximate Pre-computation

Authors:
Serafín Moral;Antonio Salmerón
Affiliations:
-;-
Venue:
ECSQARU '95 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Year:
1999

Citing 5
Cited 1

Dempster's rule of combination is #P-complete (research note)

Artificial Intelligence
A Monte-Carlo algorithm for Dempster-Shafer belief

Proceedings of the seventh conference (1991) on Uncertainty in artificial intelligence
Markov Chain Monte-Carlo algorithms for the calculation of Dempster-Shafer belief

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Simulation and the Monte Carlo Method

Simulation and the Monte Carlo Method
Fast-Division Architecture for Dempster-Shafer Belief Functions

ECSQARU/FAPR '97 Proceedings of the First International Joint Conference on Qualitative and Quantitative Practical Reasoning

Particle filtering in the Dempster--Shafer theory

International Journal of Approximate Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

In his paper, a new Monte Carlo algorithm for combining Dempster-Shafer belief functions is introduced. It is based on the idea of approximate pre-computation, which allows to obtain more accurate estimations by means of carrying out a compilation phase previously to the simulation. Some versions of the new algorithm are experimentally compared to the previous methods.