Fast b-matching via sufficient selection belief propagation

Journal of Machine Learning Research

Volumn 15, Issue , 2011, Pages 361-369

  Huang, Bert ^a   Jebara, Tony ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

B-MATCHING; BELIEF PROPAGATION; BELIEF PROPAGATION ALGORITHM; DESCRIPTORS; EDGE WEIGHTS; KERNEL FUNCTION; PARALLELIZATIONS; TIME REQUIREMENTS;

ARTIFICIAL INTELLIGENCE; PERSONAL COMPUTERS;

ALGORITHMS;

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

References (21)

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. M. Bayati, C. Borgs, J. T. Chayes, and R. Zecchina. Belief-propagation for weighted b-matchings on arbitrary graphs and its relation to linear programs with integer solutions. CoRR, abs/0709.1190, 2007.
3. T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to algorithms. McGraw-Hill Book Company, Cambridge, London, 2 edition, 2001.
4. A. Danyluk, L. Bottou, and M. Littman, editors. Proceedings of the 26th Annual International Conference on Machine Learning, ICML 2009, Montreal, Quebec, Canada, June 14-18, 2009, volume 382 of ACM International Conference Proceeding Series, 2009. ACM. ISBN 978-1-60558-516-1.
5. R. Duan and S. Pettie. Approximating maximum weight matching in near-linear time. In Proceedings 51st IEEE Symposium on Foundations of Computer Science (FOCS), 2010.
6. C. Fremuth-Paeger and D. Jungnickel. Balanced network flows. i. a unifying framework for design and analysis of matching algorithms. Networks, 33(1), 1999.
7. H. N. Gabow and R. E. Tarjan. Faster scaling algorithms for network problems. SIAM J. Comput., 18(5):1013-1036, 1989.
8. B. Huang and T. Jebara. Loopy belief propagation for bipartite maximum weight b-matching. In M. Meila and X. Shen, editors, Proceedings of the 11th International Conference on Artificial Intelligence and Statistics, volume 2 of JMLR: W&CP, March 2007.
9. B. Huang and T. Jebara. Exact graph structure estimation with degree priors. In M. Wani, M. Kantardzic, V. Palade, L. Kurgan, and Y. Qi, editors, ICMLA, pages 111-118. IEEE Computer Society, 2009. ISBN 978-0-7695-3926-3.
10. T. Jebara and V. Shchogolev. B-matching for spectral clustering. In J. Fürnkranz, T. Scheffer, and M. Spiliopoulou, editors, ECML, volume 4212 of Lecture Notes in Computer Science, pages 679-686. Springer, 2006. ISBN 3-540-45375-X.
11. T. Jebara, J. Wang, and S.-F. Chang. Graph construction and b-matching for semi-supervised learning. In Danyluk et al. (2009), page 56. ISBN 978-1-60558-516-1.
12. A. Karatzoglou, A. Smola, and M. Weimer. Collaborative filtering on a budget. In Y. Teh and M. Titterington, editors, Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics (AISTATS), volume 9, pages 389-396, 2010.
13. V. Kolmogorov. Blossom v: a new implementation of a minimum cost perfect matching algorithm. Mathematical Programming Computation, 1:43-67, 2009. ISSN 1867-2949. URL http://dx.doi.org/10.1007/s12532-009-0002-8.10.1007/s12532-009- 0002-8.
14. Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner. Gradient-based learning applied to document recognition. In Intelligent Signal Processing, pages 306-351. IEEE Press, 2001.
15. J. McAuley and T. Caetano. Faster algorithms for maxproduct message-passing. CoRR, abs/0910.3301, 2009.
16. J. McAuley and T. Caetano. Exploiting data-independence for fast belief-propagation. In J. Fürnkranz and T. Joachims, editors, ICML, pages 767-774. Omnipress, 2010.
17. J. Salez and D. Shah. Optimality of belief propagation for random assignment problem. In C. Mathieu, editor, SODA, pages 187-196. SIAM, 2009.
18. S. Sanghavi, D. Malioutov, and A. Willsky. Linear programming analysis of loopy belief propagation for weighted matching. In J. Platt, D. Koller, Y. Singer, and S. Roweis, editors, Advances in Neural Information Processing Systems 20, pages 1273-1280, Cambridge, MA, 2007. MIT Press.
19. P. Sankowski. Maximum weight bipartite matching in matrix multiplication time. Theor. Comput. Sci., 410(44): 4480-4488, 2009.
20. B. Shaw and T. Jebara. Minimum volume embedding. In M. Meila and X. Shen, editors, Proceedings of the 11th International Conference on Artificial Intelligence and Statistics, volume 2 of JMLR: W&CP, March 2007.
21. B. Shaw and T. Jebara. Structure preserving embedding. In Danyluk et al. (2009), page 118. ISBN 978-1-60558-516-1.