Finding the M most probable configurations using loopy belief propagation

Advances in Neural Information Processing Systems

Volumn , Issue , 2004, Pages

  Yanover, Chen ^a   Weiss, Yair ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BACKPROPAGATION; FORESTRY;

CLIQUE SIZE; EXACT INFERENCE; GRAPHICAL MODEL; HIDDEN VARIABLE; JUNCTION TREES; LOOPY BELIEF PROPAGATION; MAX-PRODUCT; MOST PROBABLE CONFIGURATIONS;

INFERENCE ENGINES;

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

References (18)

1. A. Cano, S. Moral, and A. Salmeron. Penniless propagation in join trees. Journal of Intelligent Systems, 15:1010-1027, 2000.
2. R. Cowell. Advanced inference in Bayesian networks. In M.I. Jordan, editor, Learning in Graphical Models. MIT Press, 1998.
3. P. Dawid. Applications of a general propagation algorithm for probabilistic expert systems. Statistics and Computing, 2:25-36, 1992.
4. R. Dechter and I. Rish. A scheme for approximating probabilistic inference. In Uncertainty in Artificial Intelligence (UAI 97), 1997.
5. A. Doucet, N. de Freitas, K. Murphy, and S. Russell. Rao-blackwellised particle filtering for dynamic bayesian networks. In Proceedings UAI 2000. Morgan Kaufmann, 2000.
6. B.J. Frey, R. Koetter, and N. Petrovic. Very loopy belief propagation for unwrapping phase images. In Adv. Neural Information Processing Systems 14. MIT Press, 2001.
7. T.S. Jaakkola and M.I. Jordan. Variational probabilistic inference and the QMR-DT database. JAIR, 10:291-322, 1999.
8. Andrew R. Leach and Andrew P. Lemon. Exploring the conformational space of pro- Tein side chains using dead-end elimination and the A* algorithm. Proteins: Structure, Function, and Genetics, 33(2):227-239, 1998.
9. A. Levin, A. Zomet, and Y. Weiss. Learning to perceive transparency from the statistics of natural scenes. In Proceedings NIPS 2002. MIT Press, 2002.
10. Kevin Murphy. The bayes net toolbox for matlab. Computing Science and Statistics, 33, 2001.
11. D. Nilsson. An efficient algorithm for finding the M most probable configurations in probabilistic expert systems. Statistics and Computing, 8:159-173, 1998.
12. Judea Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, 1988.
13. L.R. Rabiner. A tutorial on hidden Markov models and selected applications in speech recognition. Proc. IEEE, 77(2):257-286, 1989.
14. M. J.Wainwright, T. Jaakkola, and A. S. Willsky. Exact map estimates by (hyper)tree agreement. In Proceedings NIPS 2002. MIT Press, 2002.
15. M. J. Wainwright, T. Jaakkola, and A. S. Willsky. Tree consistency and bounds on the performance of the max-product algorithm and its generalizations. Technical Report P-2554, MIT LIDS, 2002.
16. Y. Weiss and W.T. Freeman. On the optimality of solutions of the max-product belief propagation algorithm in arbitrary graphs. IEEE Transactions on Information Theory, 47(2):723-735, 2001.
17. C. Yanover and Y. Weiss. Approximate inference and protein folding. In Proceedings NIPS 2002. MIT Press, 2002.
18. J. Yedidia, W. Freeman, and Y. Weiss. Understanding belief propagation and its generalizations. In G. Lakemeyer and B. Nebel, editors, Exploring Artificial Intelligence in the New Millennium. Morgan Kaufmann, 2003.