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.
This work has been supported by CICYT under projects TIC97-1135-C04-01 and TIC97-1135-C04-02.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bissig, R., Kohlas, J., Lehmann, N. (1997). Fast-division architecture for Dempster-Shafer belief functions. D. Gabbay, R. Kruse, A. Nonnengart and H.J. Ohlbach (eds.), Qualitative and Quantitative Practical Reasoning, First International Joint Conference on Qualitative and Quantitative Practical Reasoning; ECSQARU-FAPR’97. Lecture Notes in Artificial Intelligence. Springer.
Dempster, A.P. (1967). Upper and lower probabilities induced by a multivalued mapping. Annals of Mathematical Statistics, (38):325–339.
Hernández, L.D., Moral, S., Salmer-on, A. (1996). Importance sampling algorithms for belief networks based on approximate computation. Proceedings of the Sixth International Conference IPMU’96. Vol. II, 859–864.
Hernández, L.D., Moral, S., Salmerün, A. (1998). A Monte Carlo algorithm for probabilistic propagation based on importance sampling and stratified simulation techniques. International Journal of Approximate Reasoning, (18):53–91.
Moral, S., Wilson, N. (1994). Markov-Chain Monte-Carlo algorithms for the calculation of Dempster-Shafer Belief. Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-94) Vol. 1, 269–274.
Moral, S., Wilson, N. (1996). Importance sampling algorithms for the calculation of Dempster-Shafer belief. Proceedings of the IPMU-96 Conference, Vol. 3, 1337–1344.
Orponen, P. (1990). Dempster’s rule is #P-complete. Artificial Intelligence, (44):245–253.
Rubinstein, R.Y. (1981). Simulation and the Monte Carlo Method. Wiley (New York).
Salmer-on, A., Jensen, F.V. (1997). HUGIN architecture for propagating belief functions. Technical Report #GAD9702. Data Analysis Group. University of Almería.
Shafer, G. (1976). A mathematical theory of evidence. Princeton University Press, Princeton, NJ.
Wilson, N. (1991). A Monte Carlo algorithm for Dempster-Shafer belief. Proc. of the 7th Conference on Uncertainty in Artificial Intelligence, B. D’Ambrosio, P. Smets and P. Bonissone (eds.), Morgan Kaufmann, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moral, S., Salmerón, A. (1999). A Monte Carlo Algorithm for Combining Dempster-Shafer Belief Based on Approximate Pre-Computation. In: Hunter, A., Parsons, S. (eds) Symbolic and Quantitative Approaches to Reasoning and Uncertainty. ECSQARU 1999. Lecture Notes in Computer Science(), vol 1638. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48747-6_28
Download citation
DOI: https://doi.org/10.1007/3-540-48747-6_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66131-3
Online ISBN: 978-3-540-48747-0
eBook Packages: Springer Book Archive