[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

Comparing Hierarchical Markov Networks and Multiply Sectioned Bayesian Networks

  • Conference paper
Foundations of Intelligent Systems (ISMIS 2003)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2871))

Included in the following conference series:

  • 506 Accesses

Abstract

Multiply sectioned Bayesian networks (MSBNs) were originally proposed as a modular representation of uncertain knowledge by sectioning a large Bayesian network (BN) into smaller units. More recently, hierarchical Markov networks (HMNs) were developed in part as an hierarchical representation of the flat BN.

In this paper, we compare the MSBN and HMN representations. The MSBN representation does not specify how to section a BN, nor is it a faithful representation of BNs. On the contrary, a given BN has a unique HMN representation, which encodes precisely those independencies encoded in the BN. More importantly, we show that failure to encode known independencies can lead to unnecessary computation in the MSBN representation. These results, in particular, suggest that HMNs may be a more natural representation of BNs than MSBNs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Butz, C.J., Hu, Q., Yang, X.D.: Critical remarks on the maximal prime decomposition of Bayesian networks. To appear in Proc. 9th International Conf. on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing (2003)

    Google Scholar 

  2. Kjaerulff, U.: Nested junction trees. In: Proc. 13th Conf. on Uncertainty in Artificial Intelligence, pp. 302–313 (1997)

    Google Scholar 

  3. Koller, D., Pfeffer, A.: Object-oriented Bayesian networks. In: Thirteenth Conference on Uncertainty in Artificial Intelligence, pp. 302–313 (1997)

    Google Scholar 

  4. 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)

    Article  Google Scholar 

  5. Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Francisco (1988)

    Google Scholar 

  6. Shachter, R.D.: A graph-based inference method for conditional independence. In: Proc. 7th Conf. on Uncertainty in Artificial Intelligence, pp. 353–360 (1991)

    Google Scholar 

  7. Srinivas, S.: A probabilistic approach to hierarchical model-based diagnosis. In: Proc. 10th Conf. on Uncertainty in Artificial Intelligence, pp. 538–545 (1994)

    Google Scholar 

  8. Wong, S.K.M., Butz, C.J.: Constructing the dependency structure of a multiagent probabilistic network. IEEE Trans. Knowl. Data Eng. 13(3), 395–415 (2001)

    Article  Google Scholar 

  9. 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)

    Article  Google Scholar 

  10. Wong, S.K.M., Butz, C.J., Wu, D.: On undirected representations of Bayesian networks. In: ACM SIGIR Workshop on Mathematical/Formal Models in Information Retrieval, pp. 52–59 (2001)

    Google Scholar 

  11. Xiang, Y.: Optimization of inter-subnet belief updating in multiply sectioned Bayesian networks. In: Proc. 11th Conf. on Uncertainty in Artificial Intelligence, pp. 565– 573 (1995)

    Google Scholar 

  12. Xiang, Y.: Probabilistic Reasoning in Multi-Agent Systems: A Graphical Models Approach. Cambridge Publishers (2002)

    Google Scholar 

  13. Xiang, Y., Poole, D., Beddoes, M.: Exploring localization in Bayesian networks for large expert systems. In: Proc. 8th Conf. on Uncertainty in Artificial Intelligence, pp. 344–351 (1992)

    Google Scholar 

  14. Xiang, Y., Poole, D., Beddoes, M.: Multiply sectioned Bayesian networks and junction forests for large knowledge based systems. Computational Intelligence 9(2), 171–220 (1993)

    Article  Google Scholar 

  15. Xiang, Y., Olesen, K.G., Jensen, F.V.: Practical issues in modeling large diagnostic systems with multiply sectioned Bayesian networks. International Journal of Pattern Recognition and Artificial Intelligence 14(1), 59–71 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Butz, C.J., Geng, H. (2003). Comparing Hierarchical Markov Networks and Multiply Sectioned Bayesian Networks. In: Zhong, N., Raś, Z.W., Tsumoto, S., Suzuki, E. (eds) Foundations of Intelligent Systems. ISMIS 2003. Lecture Notes in Computer Science(), vol 2871. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39592-8_77

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39592-8_77

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20256-1

  • Online ISBN: 978-3-540-39592-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics