Abstract
The efficiency of inference in both the Hugin and the Shafer-Shenoy architectures can be improved by exploiting the independence relations induced by the incoming messages of a clique. That is, the message to be sent from a clique can be computed via a factorization of the clique potential in the form of a junction tree. In this paper we show that by exploiting such nested junction trees in the computation of messages both space and time costs of the conventional propagation methods may be reduced. The paper presents a structured way of exploiting the nested junction trees technique to achieve such reductions. The usefulness of the method is emphasized through a thorough empirical evaluation involving ten large real-world Bayesian networks and both the Hugin and the Shafer-Shenoy inference algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Andreassen, S., Rovorka, R., Benn, J., Olesen, K. G. and Carson, E. R. (1991) A model-based approach to insulin adjustment, inM. Stefanelli, A. Hasman, M. Fieschi and J. Talmon (eds), Proceedings of the Third Conference on Artificial Intelligence in Medicine, Springer-Verlag, pp. 239–248.
Andreassen, S., Jensen, F. V., Andersen, S. K., Falck, B., Kjærulff, U., Woldbye, M., Sørensen, A. R., Rosenfalck, A. and Jensen, F. (1989) MUNIN — an expert EMG assistant, inJ. E. Desmedt (ed.), Computer-Aided Electromyography and Expert Systems, Elsevier Science Publishers B. V. (North-Holland), Amsterdam, Chapter 21.
Frydenberg, M. (1989) The chain graph Markov property, Scandinavian Journal of Statistics, 17, pp. 333–353.
Jensen, F. V. (1996) An Introduction to Bayesian Networks. UCL Press, London.
Jensen, F. V., KjØrulff, U., Olesen, K. G. and Pedersen, J. (1989) Et forprojekt til et ekspertsystem for drift of spildevandsrensning (an expert system for control of waste water treatment — a pilot project), Technical report, Judex Datasystemer A/S, Aalborg, Denmark. In Danish.
Jensen, C. S. and Kong, A. (1996) Blocking Gibbs sampling for linkage analysis in large pedigrees with many loops, Research Report R-96–2048, Department of Computer Science, Aalborg University, Denmark, Fredrik Bajers Vej 7, DK-9220 Aalborg Ø.
Jensen, F. V., Lauritzen, S. L. and Olesen, K. G. (1990) Bayesian updating in causal probabilistic networks by local computations, Computational Statistics Quarterly, 4, pp. 269–282.
Beckerman, D., Horvitz, E. and Nathwani, B. (1992) Toward normative expert systems: Part I. The Pathfinder project, Methods of Information in Medicine, 31, pp. 90–105.
Kim, J. H. and Pearl, J. (1983) A computational model for causal and diagnostic reasoning in inference systems. In Proceedings of the Eighth International Joint Conference on Artificial Intelligence, pp. 190–193.
Lauritzen, S. L., Dawid, A. P., Larsen, B. N. and Leimer, H.-G. (1990) Independence properties of directed Markov fields, Networks, 20, pp. 491–505.
Lauritzen, S. L. and Spiegelhalter, D. J. (1988) Local computations with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society, Series B, 50, pp. 157–224.
Shafer, G. and Shenoy, P. P. (1990) Probability propagation, Annals of Mathematics and Artificial Intelligence, 2, pp. 327–352.
Shenoy, P. P. (1996) Binary Join Trees, in D. Geiger and P. Shenoy (eds.), Proceedings of the Twelfth Conference on Uncertainty in Artificial Intelligence, Morgan Kaufmann Publishers, San Francisco, California, pp. 492–499.
Xu, H. (1994) Computing marginals from the marginal representation in Markov trees, in Proceedings of the Fifth International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems(IPMU), Cite Internationale Universitaire, Paris, France, pp. 275–280.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Kjærulff, U. (1998). Inference in Bayesian Networks Using Nested Junction Trees. In: Jordan, M.I. (eds) Learning in Graphical Models. NATO ASI Series, vol 89. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-5014-9_3
Download citation
DOI: https://doi.org/10.1007/978-94-011-5014-9_3
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-6104-9
Online ISBN: 978-94-011-5014-9
eBook Packages: Springer Book Archive