Skip to main content
SpringerLink
Log in

Computational Properties of Two Exact Algorithms for Bayesian Networks

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

This paper studies computational properties of two exact inference algorithms for Bayesian networks, namely the clique tree propagation algorithm (CTP)1 and the variable elimination algorithm (VE). VE permits pruning of nodes irrelevant to a query while CTP facilitates sharing of computations among different queries. Experiments have been conducted to empirically compare VE and CTP. We found that, contrary to common beliefs, VE is often more efficient than CTP, especially in complex networks.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. Pearl, Probabilistic Reasoning in Intelligence Systems: Networks of Plausible Inference, Morgan Kaufmann Publishers: Los Altos, CA, 1988.

    Google Scholar 

  2. S.L. Lauritzen and D.J. Spiegelhalter, “Local computations with probabilities on graphical structures and their applications to expert systems,” Journal of Royal Statistical Society B, vol. 50, no. 2, pp. 157- 224, 1988.

    Google Scholar 

  3. G. Shafer and P. Shenoy, “Probability propagation,” Annals of Mathematics and Artificial Intelligence, vol. 2, pp. 327- 352, 1990.

    Google Scholar 

  4. F.V. Jensen, K.G. Olesen, and K. Anderson, “An algebra of Bayesian belief universes for knowledge-based systems,” Networks, vol. 20, pp. 637- 659, 1990.

    Google Scholar 

  5. R. Shachter, “Evaluating influence diagrams,” Operations Research, vol. 34, pp. 871- 882, 1986.

    Google Scholar 

  6. R. Shachter, “Probabilistic inference and influence diagrams,” Operations Research, vol. 36, pp. 589- 605, 1988.

    Google Scholar 

  7. P.P. Shenoy, “Valuation-based systems for Bayesian decision analysis,” Operations Research, vol. 40, no.3, pp. 463- 484, 1992.

    Google Scholar 

  8. G. Shafer, Probabilistic Expert Systems, SIAM, 1996.

  9. N.L. Zhang and D. Poole, “A simple approach to Bayesian network computations,” in Proceedings of the Tenth Canadian Conference on Artificial Intelligence, 1994, pp. 171- 178.

  10. D. Heckerman, “Causal independence for knowledge acquisition and inference,” in Proceedings of the Ninth Conference on Uncertainty in Artificial Intelligence, 1993, pp. 122- 127.

  11. N.L. Zhang and D. Poole, “Exploiting causal independence in Bayesian network inference,” Journal of Artificial Intelligence Research, vol. 5, pp. 301- 328, 1996.

    Google Scholar 

  12. R. Dechter, “Bucket elimination: A unifying framework for probabilistic inference,” in Proceedings of the Twelfth Conference on Uncertainty in Artificial Intelligence, 1996, pp. 211- 219.

  13. M. Pradhan, G. Provan, B. Middleton, and M. Henrion, “Knowledge engineering for large belief networks,” in Proceedings of the Tenth Conference on Uncertainty in Artificial Intelligence, 1994, pp. 484- 490.

  14. N.L. Zhang, “Probabilistic inference in inference diagrams,” Computational Intelligence, to appear.

  15. S. Arnborg, D.G. Corneil, and A. Proskurowski, “Complexity of finding embedding in a k-tree,” SIAM J. Alg. Disc. Meth., vol. 8, no. 2, pp. 277- 284, 1987.

    Google Scholar 

  16. U. Bertelè and F. Brioschi, Nonserial dynamic programming, Mathematics in Science and Engineering, vol. 91, Academic Press, 1972.

  17. R.E. Tarjan and M. Yannakakis, “Simple linear time algorithm to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs,” SIAM J. Comput., vol. 13, pp. 566- 579, 1984.

    Google Scholar 

  18. U. Kjæ rulff, “Reduction of computational complexity in Bayesian networks through removal of weak dependences,” in Proceedings of the Tenth Conference on Uncertainty in Artificial Intelligence, 1994, pp. 374- 382.

  19. D. Geiger, T. Verma, and J. Pearl, “d-Separation: From theorems to algorithms,” Uncertainty in Artificial Intelligence, vol. 5, pp. 139- 148, 1990.

    Google Scholar 

  20. S.L. Lauritzen, A.P. Dawid, B.N. Larsen, and H.G. Leimer, “Independence properties of directed Markov fields,” Networks, vol. 20, pp. 491- 506, 1990.

    Google Scholar 

  21. M. Baker and T.E. Boult, “Pruning Bayesian networks for ef-ficient computation,” in Proceedings of the Sixth Conference on Uncertainty in Artificial Intelligence, Cambridge, MA, July 1990, pp. 257- 264.

  22. L. Zhang, “Studies on hypergraphs (I): Hyperforests,” Discrete Applied Mathematics, vol. 42, pp. 95- 112, 1993.

    Google Scholar 

  23. R.C. Parker and R.A. Miller, “Using causal knowledge to create simulated patient cases: The CPCS project as an extension to Internist-I,” in Proceedings of the Eleventh Annual Symposium on Computer Applications in Medical Care, Los Angeles, CA, pp. 473- 480, 1987.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Science and Technology, Hong Kong, China

    Nevin Lianwen Zhang

Authors
  1. Nevin Lianwen Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, N.L. Computational Properties of Two Exact Algorithms for Bayesian Networks. Applied Intelligence 9, 173–183 (1998). https://doi.org/10.1023/A:1008272220579

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008272220579

Search

Navigation