Abstract
The Hugin and Shenoy–Shafer architectures are two variations on the jointree algorithm, which exhibit different tradeoffs with respect to efficiency and query answering power. The Hugin architecture is more time–efficient on arbitrary jointrees, avoiding some redundant computations performed by the Shenoy–Shafer architecture. This efficiency, however, comes at the price of limiting the number of queries the Hugin architecture is capable of answering. In this paper, we present a simple algorithm which retains the efficiency of the Hugin architecture and enjoys the query answering power of the Shenoy–Shafer architecture.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chan, H., Darwiche, A.: When do numbers really matter? In: Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence (UAI), San Francisco, California, pp. 65–74. Morgan Kaufmann Publishers, Inc., San Francisco (2001)
Cowell, R., Dawid, A., Lauritzen, S., Spiegelhalter, D.: Probabilistic Networks and Expert Systems. Springer, Heidelberg (1999)
Huang, C., Darwiche, A.: Inference in belief networks: A procedural guide. International Journal of Approximate Reasoning 15(3), 225–263 (1996)
Jensen, F.V., Lauritzen, S., Olesen, K.: Bayesian updating in recursive graphical models by local computation. Computational Statistics Quarterly 4, 269–282 (1990)
Lauritzen, S.L., Jensen, F.V.: Local computation with valuations from a commutative semigroup. Annals of Mathematics and Artificial Intelligence 21(1), 51–69 (1997)
Lepar, V., Shenoy, P.P.: A comparison of Lauritzen-Spiegelhalter, Hugin and Shenoy-Shafer architectures for computing marginals of probability distributions. In: Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence, pp. 328–337 (1998)
Park, J., Darwiche, A.: Approximating map using local search. In: Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence (UAI), San Francisco, California, pp. 403–410. Morgan Kaufmann Publishers, Inc., San Francisco (2001)
Park, J., Darwiche, A.: A differential semantics for jointree algorithms. Neural Information Processing Systems (NIPS) 15 (2003)
Russell, S., Binder, J., Koller, D., Kanazawa, K.: Local learning in probabilistic networks with hidden variables. In: Proceedings of the 11th Conference on Uncertainty in Artificial Intelligence (UAI), pp. 1146–1152 (1995)
Shenoy, P.P., Shafer, G.: Propagating belief functions with local computations. IEEE Expert 1(3), 43–52 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Park, J.D., Darwiche, A. (2003). Morphing the Hugin and Shenoy–Shafer Architectures. In: Nielsen, T.D., Zhang, N.L. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2003. Lecture Notes in Computer Science(), vol 2711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45062-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-45062-7_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40494-1
Online ISBN: 978-3-540-45062-7
eBook Packages: Springer Book Archive