Pushing the power of stochastic greedy ordering schemes for inference in graphical models

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2011, Pages 54-60

  Kask, Kalev ^a   Gelfand, Andrew ^a   Otten, Lars ^a   Dechter, Rina ^a  

^a 5226 Donald Bren Hall   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EMPIRICAL EVALUATIONS; GRAPHICAL MODEL; GREEDY ALGORITHMS; ITERATIVE SCHEMES; MULTI-CORE SYSTEMS; RANKING FUNCTIONS; STATE SPACE; TWO PARAMETER; VARIABLE ORDERING;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; GRAPHIC METHODS; INFERENCE ENGINES;

STOCHASTIC MODELS;

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

References (18)

1. Arnborg, S.; Corneil, D.; and Proskourowski, A. 1987. Complexity of finding embeddings in a k-tree. SIAM Journal of Discrete Mathematics. 8:277-284.
2. Bacchus, F.; Dalmo, S.; and Piassi, T. 2003. Value elimination: Bayesian inference via backtracking search. In Uncertainty in AI(UAI03).
3. Bodlaender, H. L. 2007. Treewidth: structure and algorithms. In SIROCCO'07, 11-25.
4. Bodlaender, H. L. 2009. Kernelization: New upper and lower bound techniques. In IWPEC, 17-37.
5. Clautiaux, F.; Moukrim, A.; Négre, S.; and Carlier, J. 2004. Heuristic and meta-heuristic methods for computing graph treewidth. RAIRO Operations Research 38:13-26.
6. Darwiche, A. 2001. Recursive conditioning. Artificial Intelligence 125(1-2):5-41. (Pubitemid 32196230)
7. Dechter, R., and Mateescu, R. 2007. AND/OR search spaces for graphical models. Artificial Intelligence 171(2-3):73-106. (Pubitemid 46328845)
8. Dechter, R., and Meiri, I. 1989. Experimental evaluation of preprocessing techniques in constraint satisfaction problems. In IJCAI'89, 271-277.
9. Dechter, R., and Rish, I. 2002. Mini-buckets: A general scheme for approximating inference. Journal of the ACM 107-153.
10. Fishelson, M., and Geiger, D. 2003. Optimizing exact genetic linkage computations. RECOMB 114-121.
11. Gogate, V., and Dechter, R. 2004. A complete anytime algorithm for tree width. In UAI04.
12. Gogate, V., and Dechter, R. 2008. AND/OR importance sampling. In UAI, 212-219.
13. Kask, K.; Dechter, R.; and Gelfand, A. E. 2010. BEEM: Bucket elimination with external memory. In UAI'2010.
14. Kjaerulff, U. 1992. Optimal decomposition of probabilistic networks by simulated annealing. Statistics and Computing 2:2-17.
15. Larranaga, P.; Kuijpers, C.; Poza, M.; and Murga, R. 1997. Decomposing bayesian networks: triangulation of the moral graph with genetic algorithms. Statistics and Computing 7:19-34.
16. Robertson, N., and Seymour, P. 1983. Graph minors i. excluding a forest. J. Combin. Theory, Ser. B 35:39-61.
17. Yanover, C., and Weiss, Y. 2002. Approximate inference and protein-folding. In NIPS, 1457-1464.
18. Yedidia, J. S.; Freeman, W.; and Weiss, Y. 2005. Constructing free-energy approximations and generalized belief propagation algorithms. IEEE Transaction on Information Theory 2282-2312. (Pubitemid 41136394)