Abstract
In this paper, we suggest a novel approach to jointree computation. Unlike all previous jointree methods, we propose that jointree computation should use conditional probability distributions rather than potentials. One salient feature of this approach is that the exact form of the messages to be transmitted throughout the network can be identified a priori. Consequently, irrelevant messages can be ignored, while relevant messages can be computed more efficiently. We discuss four advantages of our jointree propagation method.
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
Jensen, F.V., Lauritzen, S.L., Olesen, K.G.: Bayesian updating in causal probabilistic networks by local computations. Computational Statistics Quarterly 4, 269–282 (1990)
Madsen, A.L., Jensen, F.V.: Lazy propagation: a junction tree inference algorithm based on lazy evaluation. Artificial Intelligence 113(1-2), 203–245 (1999)
Olesen, K.G., Madsen, A.L.: Maximal prime subgraph decomposition of Bayesian networks. IEEE Transactions on Systems, Man, and Cybernetics, B 32(1), 21–31 (2002)
Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Francisco (1988)
Shafer, G.: Probabilistic Expert Systems, Society for Industrial and Applied Mathematics (1996)
Wong, S.K.M., Butz, C.J., Wu, D.: On the implication problem for probabilistic conditional independency. IEEE Transactions on Systems, Man, and Cybernetics, A 30(6), 785–805 (2000)
Wong, S.K.M., Butz, C.J.: Constructing the dependency structure of a multiagent probabilistic network. IEEE Transactions on Knowledge and Data Engineering 13(3), 395–415 (2001)
Xiang, Y.: Probabilistic Reasoning in Multiagent Systems, Cambridge (2002)
Zhang, N.L., Poole, D.: Exploiting causal independence in Bayesian network inference. Journal of Artificial Intelligence Research 5, 301–328 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Butz, C.J., Yao, H., Hamilton, H.J. (2004). Towards Jointree Propagation with Conditional Probability Distributions. In: Tsumoto, S., Słowiński, R., Komorowski, J., Grzymała-Busse, J.W. (eds) Rough Sets and Current Trends in Computing. RSCTC 2004. Lecture Notes in Computer Science(), vol 3066. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25929-9_44
Download citation
DOI: https://doi.org/10.1007/978-3-540-25929-9_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22117-3
Online ISBN: 978-3-540-25929-9
eBook Packages: Springer Book Archive