Exact graph structure estimation with degree priors

8th International Conference on Machine Learning and Applications, ICMLA 2009

Volumn , Issue , 2009, Pages 111-118

  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; COMBINATORIAL OPTIMIZATION PROBLEMS; DEGREE DISTRIBUTIONS; GENERATIVE MODEL; GRAPH EDGES; GRAPH STRUCTURES; INFERENCE METHODS; INFERENCE PROBLEM; INPUT GRAPHS; LOOPY BELIEF PROPAGATION; MAX-PRODUCT; POLYNOMIAL-TIME; POST PROCESSING; QUADRATIC TIME; RECOMMENDER SYSTEMS; SUBGRAPHS;

GRAPHIC METHODS; LEARNING SYSTEMS; POLYNOMIAL APPROXIMATION;

COMBINATORIAL OPTIMIZATION;

EID: 77950819098     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICMLA.2009.103     Document Type: Conference Paper

References (19)

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), 1999.
3. A. Gelman, J. Carlin, H. Stern, and D. Rubin. Bayesian Data Analysis, Second Edition. Chapman & Hall/CRC, July 2003.
4. K. Goldberg, T. Roeder, D. Gupta, and C. Perkins. Eigentaste: A constant time collaborative filtering algorithm. Inf. Retr., 4(2), 2001.
5. B. Huang and T. Jebara. Loopy belief propagation for bipartite maximum weight b-matching. In Marina Meila and Xiaotong Shen, editors, Proceedings of the 11th International Conference on Artificial Intelligence and Statistics, volume 2 of JMLR: W&CP, March 2007.
6. T. Jebara. Map estimation, message passing, and perfect graphs. In Uncertainty in Artificial Intelligence, 2009.
7. T. Jebara, J. Wang, and S.F. Chang. Graph construction and b-matching for semi-supervised learning. In International Conference on Machine Learning, 2009.
8. P. M. Kim, L. J. Lu, Y. Xia, and M. B. Gerstein. Relating three-dimensional structures to protein networks provides evolutionary insights. Science, 314(5807):1938-1941, 2006 Dec 22.
9. P. Massa and P. Avesani. Controversial users demand local trust metrics: An experimental study on epinions.com community. In Manuela M. Veloso and Subbarao Kambhampati, editors, AAAI. MIT Press, 2005.
10. C. McDiarmid. On the method of bounded differences. Surveys in Combinatorics, 1989.
11. A. Mehta, A. Saberi, U. Vazirani, and V. Vazirani. Adwords and generalized online matching. J. ACM, 54(5), 2007.
12. Q. Morris and B. Frey. Denoising and untangling graphs using degree priors. In Advances in Neural Information Processing Systems 16. MIT Press, 2003.
13. J. Rennie. Extracting information from informal communication. PhD thesis, MIT, 2007.
14. J. Rennie and N. Srebro. Fast maximum margin matrix factorization for collaborative prediction. In Proceedings of the 22nd international conference on Machine learning. ACM, 2005.
15. J. Salez and D. Shah. Optimality of belief propagation for random assignment problem. In Claire Mathieu, editor, SODA, pages 187-196. SIAM, 2009.
16. S. Sanghavi, D. Malioutov, and A. Willsky. Linear programming analysis of loopy belief propagation for weighted matching. In Advances in Neural Information Processing Systems 20. MIT Press, 2008.
17. B. Shaw and T. Jebara. Minimum volume embedding. In Marina Meila and Xiaotong Shen, editors, Proceedings of the 11th International Conference on Artificial Intelligence and Statistics, volume 2 of JMLR: W&CP, March 2007.
18. B. Shaw and T. Jebara. Structure preserving embedding. In International Conference on Machine Learning, 2009.
19. C.-N. Ziegler, S. McNee, J. Konstan, and G. Lausen. Improving recommendation lists through topic diversification. In Allan Ellis and Tatsuya Hagino, editors, WWW. ACM, 2005.