An alternative to outward propagation for dempster-shafer belief functions

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

Volumn 1638, Issue , 1999, Pages 256-267

  Lehmann, Norbert ^a   Haenni, Rolf ^a  

^a UNIVERSITY OF FRIBOURG   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

MESSAGE PASSING;

BELIEF FUNCTION; DEMPSTER-SHAFER; MARKOV TREES; ROOT NODES; VALUATION NETWORKS;

UNCERTAINTY ANALYSIS;

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

References (17)

1. R.G. Almond. Graphical Belief Modeling. Chapman & Hall, London, UK, 1995.
2. R. Bissig, J. Kohlas, and N. Lehmann. Fast-division architecture for dempster-shafer belief functions. In Dov M. Gabbay, R. Kruse, A. Nonnengart, and H.J. Ohlbach, editors, First International Joint Conference on Qualitative and Quantitative Practical Reasoning ECSQARU-FAPR’97, Bad Honnef, pages 198-209. Springer-Verlag, 1997.
3. A.P. Dempster and A. Kong. Uncertain evidence and arti cial analysis. Journal of Statistical Planning and Inference, 20:355-368, 1988.
4. F.V. Jensen, K.G. Olesen, and S.K. Andersen. An algebra of bayesian belief universes for knowledge-based systems. Networks, 20(5):637-659, 1990.
5. F.V. Jensen, S.L. Lauritzen, and K.G. Olesen. Bayesian updating in causal probabilistic networks by local computations. Computational Statistics Quarterly, 4:269-282, 1990.
6. J. Kohlas and P.A. Monney. A Mathematical Theory of Hints. An Approach to the Dempster-Shafer Theory of Evidence, volume 425 of Lecture Notes in Economics and Mathematical Systems. Springer-Verlag, 1995.
7. S.L. Lauritzen and F.V. Jensen. Local computation with valuations from a commutative semigroup. Annals of Mathematics and Artificial Intelligence, 21(1):51-70, 1997.
8. S.L. Lauritzen and D.J. Spiegelhalter. Local computations with probabilities on graphical structures and their application to expert systems. Journal of Royal Statistical Society, 50(2):157-224, 1988.
9. J. Pearl. Fusion, propagation and structuring in belief networks. Artificial Intelligence, 29:241-288, 1986.
10. G. Shafer. The Mathematical Theory of Evidence. Princeton University Press, 1976.
11. G. Shafer. An axiomatic study of computation in hypertrees. Working Paper 232, School of Business, The University of Kansas, 1991.
12. P.P. Shenoy. A valuation-based language for expert systems. International Journal of Approximate Reasoning, 3:383-411, 1989.
13. P.P. Shenoy. Binary join trees for computing marginals in the Shenoy-Shafer architecture. International Journal of Approximate Reasoning, 17:239-263, 1997.
14. P.P. Shenoy and G. Shafer. Axioms for probability and belief functions propagation. In R.D. Shachter and al., editors, Proceedings of the fth Conference on Uncertainty in Artificial Intelligence, pages 169-198. North Holland, 1990.
15. Ph. Smets. Belief functions. In D. Dubois Ph. Smets, A. Mamdani and H. Prade, editors, Nonstandard logics for automated reasoning, pages 253-286. Academic Press, 1988.
16. V. Lepar and P.P. Shenoy. A comparison of Lauritzen-Spiegelhalter, Hugin and Shenoy-Shafer architectures for computing marginals of probability distributions. Uncertainty in Artificial Intelligence, 14:328-337, 1998.
17. H. Xu. An efficient implementation of belief function propagation. In D’Ambrosio B.D., Smets Ph., and Bonissone P.P., editors, Proceedings of the 7th Conference on Uncertainty in Artificial Intelligence, pages 425-432. Morgan Kaufmann, San Mateo, CA, 1997.