Node splitting: A scheme for generating upper bounds in Bayesian networks

Proceedings of the 23rd Conference on Uncertainty in Artificial Intelligence, UAI 2007

Volumn , Issue , 2007, Pages 57-66

  Choi, Arthur ^a   Chavira, Mark ^a   Darwiche, Adnan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE INFERENCE; APPROXIMATE MODEL; BRANCH AND BOUNDS; EXACT INFERENCE; SEARCH ALGORITHMS; SEARCH SPACES; SPLITTING NODES; UPPER BOUND;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; INFERENCE ENGINES;

BAYESIAN NETWORKS;

EID: 57749191204     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Chavira, M., & Darwiche, A. (2006). Encoding CNFs to empower component analysis. In SAT, pp. 61-74. Springer Berlin / Heidelberg, Lecture Notes in Computer Science, Volume 4121. (Pubitemid 44531745)
2. Chavira, M., & Darwiche, A. (2007). Compiling Bayesian networks using variable elimination. In IJCAI, pp. 2443-2449.
3. Choi, A., & Darwiche, A. (2006a). An edge deletion semantics for belief propagation and its practical impact on approximation quality. In AAAI, pp. 1107-1114. (Pubitemid 44705424)
4. Choi, A., & Darwiche, A. (2006b). A variational approach for approximating Bayesian networks by edge deletion. In UAI, pp. 80-89.
5. Dechter, R. (1996). Bucket elimination: A unifying framework for probabilistic inference. In UAI, pp. 211-219.
6. Dechter, R., Kask, K., & Mateescu, R. (2002). Iterative join-graph propagation. In UAI, pp. 128-136.
7. Dechter, R., & Rish, I. (2003). Mini-buckets: A general scheme for bounded inference. J. ACM, 50(2), 107-153.
8. Frey, B. J., & MacKay, D. J. C. (1997). A revolution: Belief propagation in graphs with cycles. In NIPS, pp. 479-485.
9. Huang, J., Chavira, M., & Darwiche, A. (2006). Solving map exactly by searching on compiled arithmetic circuits. In AAAI, pp. 143-148.
10. Hutter, F., Hoos, H. H., & Stützle, T. (2005). Efficient stochastic local search for MPE solving. In IJCAI, pp. 169-174.
11. Kolmogorov, V., & Wainwright., M. J. (2005). On the optimality of tree-reweighted max-product message passing. In UAL
12. Marinescu, R., & Dechter, R. (2005). AND/OR branch-and-bound for graphical models. In IJCAI, pp. 224-229.
13. Marinescu, R., Kask, K., & Dechter, R. (2003). Systematic vs. non-systematic algorithms for solving the MPE task. In UAI, pp. 394-402.
14. Park, J. D. (2002). Using weighted max-sat engines to solve MPE. In AAAI/IAAI, pp. 682-687.
15. Pearl, J. (1988). Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers, Inc., San Mateo, California.
16. Rish, I., Kask, K., & Dechter, R. (1998). Empirical evaluation of approximation algorithms for probabilistic decoding. In UAI, pp. 455-463.
17. Sang, T., Beame, P., & Kautz, H. (2005). Solving Bayesian networks by weighted model counting. In AAAI, Vol. 1, pp. 475-482. AAAI Press.
18. Suermondt, H. J., & Cooper, G. F. (1990). Probabilistic inference in multiply connected networks using loop cutsets. IJAR, 4, 283-306.
19. Wainwright, M. J., Jaakkola, T., & Willsky, A. S. (2005). Map estimation via agreement on trees: message-passing and linear programming. IEEE Transactions on Information Theory, 51(11), 3697-3717. (Pubitemid 41622574)
20. Weiss, Y. (2000). Correctness of local probability propagation in graphical models with loops. Neural Computation, 12(1), 1-41.
21. Yedidia, J., Freeman, W., & Weiss, Y. (2005). Constructing free-energy approximations and generalized belief propagation algorithms. IEEE Transactions on Information Theory, 51(7), 2282-2312. (Pubitemid 41136394)
22. Zhang, N. L., & Poole, D. (1996). Exploiting causal independence in bayesian network inference. Journal of Artificial Intelligence Research, 5, 301-328. (Pubitemid 126646171)