Exploiting Dynamic Independence in a Static Conditioning Graph

  • Kevin Grant
  • Michael C. Horsch
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4013)


A conditioning graph (CG) is a graphical structure that attempt to minimize the implementation overhead of computing probabilities in belief networks. A conditioning graph recursively factorizes the network, but restricting each decomposition to a single node allows us to store the structure with minimal overhead, and compute with a simple algorithm. This paper extends conditioning graphs with optimizations that effectively reduce the height of the CG, thus reducing time complexity exponentially, while increasing the storage requirements by only a constant factor. We conclude that CGs are frequently as efficient as any other exact inference method, with the advantage of being vastly superior to VE and JT in terms of space complexity, and far simpler to implement.


Bayesian Network Leaf Node Internal Node Conditional Probability Table Irrelevant Variable 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Allen, D., Darwiche, A.: Optimal time–space tradeoff in probabilistic inference. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-2003), pp. 969–975 (2003)Google Scholar
  2. 2.
    Darwiche, A.: Recursive Conditioning: Any-space conditioning algorithm with treewidth-bounded complexity. Artificial Intelligence, 5–41 (2000)Google Scholar
  3. 3.
    Darwiche, A., Provan, G.: Query dags: A practical paradigm for implementing belief network inference. In: Proceedings of the 12th Annual Conference on Uncertainty in Artificial Intelligence, pp. 203–210 (1996)Google Scholar
  4. 4.
    Dechter, R.: Bucket elimination: A unifying framework for reasoning. Artificial Intelligence 113(1-2), 41–85 (1999)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Geiger, D., Verma, T., Pearl, J.: Identifying independence in Bayesian networks. Networks 20, 507–534 (1990)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Grant, K., Horsch, M.: Conditioning Graphs: Practical Structures for Inference in Bayesian Networks. In: Proceedings of the The 18th Australian Joint Conference on Artificial Intelligence, pp. 49–59 (2005)Google Scholar
  7. 7.
    Grant, K., Horsch, M.: Methods for Constructing Balanced Elimination Trees and Other Recursive Decompositions. In: Proceedings of the the 19th International Florida Artificial Intelligence Research Society Conference (to appear, 2006)Google Scholar
  8. 8.
    Kjaerulff, U.: Triangulation of graphs - algorithms giving small total state space. Technical report, Dept. of Mathematics and Computer Science, Strandvejan, DK 9000 Aalborg, Denmark (1990)Google Scholar
  9. 9.
    Lauritzen, S., Spiegelhalter, D.: Local computations with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society 50, 157–224 (1988)MATHMathSciNetGoogle Scholar
  10. 10.
    Monti, S., Cooper, G.F.: Bounded recursive decomposition: a search-based method for belief-network inference under limited resources. Int. J. Approx. Reasoning 15(1), 49–75 (1996)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers Inc., San Francisco (1988)Google Scholar
  12. 12.
    Poole, D., Mackworth, A., Goebel, R.: Computational Intelligence. Oxford University Press, Oxford (1998)MATHGoogle Scholar
  13. 13.
    Shachter, R.D.: Evaluating influence diagrams. Oper. Res. 34(6), 871–882 (1986)CrossRefMathSciNetGoogle Scholar
  14. 14.
    Shachter, R.D.: Bayes-ball: The rational pastime (for determining irrelevance and requisite information in belief networks and influence diagrams). In: Proceedings of the 14th Annual Conference on Uncertainty in Artificial Intelligence, pp. 480–487 (1998)Google Scholar
  15. 15.
    Zhang, N., Poole, D.: A Simple Approach to Bayesian Network Computations. In: Proc. of the 10th Canadian Conference on Artificial Intelligence, pp. 171–178 (1994)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Kevin Grant
    • 1
  • Michael C. Horsch
    • 1
  1. 1.Dept. of Computer ScienceUniversity of SaskatchewanSaskatoon

Personalised recommendations