A monte carlo algorithm for combining dempster-shafer belief based on approximate pre-computation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1638, Issue , 1999, Pages 305-315

  Moral, Serafín ^a   Salmerón, Antonio ^b  

^a UNIVERSITY OF GRANADA   (Spain)

^b UNIVERSITY OF ALMERÍA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

UNCERTAINTY ANALYSIS;

ACCURATE ESTIMATION; BELIEF FUNCTION; DEMPSTER-SHAFER; MONTE CARLO ALGORITHMS; PRE-COMPUTATION;

MONTE CARLO METHODS;

EID: 84947930387     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48747-6_28     Document Type: Conference Paper

References (11)

1. 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.
2. Dempster, A.P. (1967). Upper and lower probabilities induced by a multivalued mapping. Annals of Mathematical Statistics, (38):325-339.
3. Hernández, L.D., Moral, S., Salmerón, A. (1996). Importance sampling algorithms for belief networks based on approximate computation. Proceedings of the Sixth International Conference IPMU’96. Vol. II, 859-864.
4. 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.
5. 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.
6. 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.
7. Orponen, P. (1990). Dempster’s rule is #P-complete. Artificial Intelligence, (44):245-253.
8. Rubinstein, R.Y. (1981). Simulation and the Monte Carlo Method. Wiley (New York).
9. Salmerón, A., Jensen, F.V. (1997). HUGIN architecture for propagating belief functions. Technical Report #GAD9702. Data Analysis Group. University of Almería.
10. Shafer, G. (1976). A mathematical theory of evidence. Princeton University Press, Princeton, NJ.
11. 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.