Loopy belief propagation for bipartite maximum weight b-matching

Journal of Machine Learning Research

Volumn 2, Issue , 2007, Pages 195-202

  Huang, Bert ^a   Jebara, Tony ^a  

^a Department of Earth and Environmental Sciences   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC METHOD; ASYMPTOTIC RATE; B-MATCHING; BELIEF PROPAGATION; GRAPHICAL MODEL; LOOPY BELIEF PROPAGATION; MACHINE LEARNING APPLICATIONS; OBJECTIVE FUNCTIONS; POLYNOMIAL-TIME;

ALGEBRA; ALGORITHMS; ARTIFICIAL INTELLIGENCE; BACKPROPAGATION; GRAPHIC METHODS; POLYNOMIAL APPROXIMATION; PROBABILITY DISTRIBUTIONS;

COMBINATORIAL MATHEMATICS;

EID: 84862276981     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (11)

1. M. Bayati, D. Shah, and M. Sharma. Maximum weight matching via max-product belief propagation. In Proc. of the IEEE International Symposium on Information Theory, 2005.
2. C. Fremuth-Paeger and D. Jungnickel. Balanced network flows. i. a unifying framework for design and analysis of matching algorithms. Networks, 33(1):1-28, 1999.
3. B. Frey and D. Dueck. Mixture modeling by affinity propagation. In Advances in Neural Information Processing Systems 18, pages 379-386. MIT Press, 2006.
4. T. Jebara and V. Shchogolev. B-matching for spectral clustering. In Proc. of the European Conference on Machine Learning, ECML, 2006.
5. J. Mooij and H. Kappen. Sufficient conditions for convergence of loopy belief propagation. In Proceedings of the 21th Annual Conference on Uncertainty in Artificial Intelligence (UAI-05), pages 396-40, 2005.
6. M. Müller-Hannemann and A. Schwartz. Implementing weighted b-matching algorithms: Insights from a computational study. In ACM Journal of Experimental Algorithmics, Volume 5, Article 8, 2000.
7. J. Pearl. Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1988.
8. S. Tatikonda and M. Jordan. Loopy belief propagation and Gibbs measures. In Proc. Uncertainty in Artificial Intell., vol. 18, 2002.
9. M. J. Wainwright, T. Jaakkola, and A. S. Willsky. Tree-based reparameterization framework for analysis of sum-product and related algorithms. IEEE Transactions on Information Theory, 49(5), 2003.
10. Y.Weiss. Correctness of local probability propagation in graphical models with loops. Neural Computation, 12(1):1-41, 2000.
11. Y. Weiss and W. Freeman. On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs. IEEETIT: IEEE Transactions on Information Theory, 47, 2001.