IMP: A message-passing algorithm for matrix completion

6th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2010

Volumn , Issue , 2010, Pages 462-466

  Kim, Byung Hak ^a   Yedla, Arvind ^a   Pfister, Henry D ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COLD START PROBLEMS; COLLABORATIVE FILTERING; COLLABORATIVE FILTERING SYSTEMS; DATA MATRICES; FACTOR GRAPHS; INCOMPLETE OBSERVATION; LOW-RANK MATRICES; MATRIX COMPLETION; MATRIX COMPLETION PROBLEMS; MESSAGE PASSING ALGORITHM; RECOMMENDER SYSTEMS;

DATA PROCESSING; INFERENCE ENGINES; MATRIX ALGEBRA; MESSAGE PASSING; SIGNAL FILTERING AND PREDICTION; TURBO CODES;

CLUSTERING ALGORITHMS;

EID: 78649247986     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISTC.2010.5613803     Document Type: Conference Paper

References (22)

1. E.J.Candes and B. Recht, "Exact matrix completion via convex optimization," Foundations of Computational Mathematics, pp. 1-56, 2008.
2. E. Candes and Y. Plan, "Matrix completion with noise," to appear in Proceedings of the IEEE, 2009.
3. [Online]. Available: http://www.netflixprize.com.
4. J. Cai, E. Candes, and Z. Shen, "A singular value thresholding algorithm for matrix completion," Oct. 2008, [Online]. Available: http://arxiv.org/abs/0810.3286.
5. K. Lee and Y. Bresler, "Admira: Atomic decomposition for minimum rank approximation," Arxiv preprint cs.IT/0905.0044, 2009.
6. R. Keshavan, A. Montanari, and S. Oh, "Matrix completion from noisy entries," June 2009, [Online]. Available: http://arxiv.org/abs/0906.2027.
7. W. Dai and O. Milenkovic, "Set: an algorithm for consistent matrix completion," Sept. 2009, [Online]. Available: http://arxiv.org/abs/0909. 2705.
8. R. Salakhutdinov and A. Mnih, "Bayesian probabilistic matrix factorization using Markov chain Monte Carlo," in Proceedings of the International Conference on Machine Learning, vol. 25, 2008.
9. E. Candes and T. Tao, "The power of convex relaxation: Near-optimal matrix completion," March 2009, [Online]. Available: http://arxiv.org/abs/ 0903.1476.
10. R. Keshavan, S. Oh, and A. Montanari, "Matrix completion from a few entries," Sept. 2009, [Online]. Available: http://arxiv.org/abs/0901. 3150v4.
11. S. Aditya, O. Dabeer, and B. Dey, "A channel coding perspective of collaborative filtering," Aug. 2009, submitted to IEEE Trans. on Inform. Theory [Online]. Available: http://arxiv.org/abs/0908.2494.
12. S. Vishwanath, "Information theoretic bounds for low-rank matrix completion," Jan. 2010, [Online]. Available: http://arxiv.org/abs/1001. 2331.
13. A. Schein, A. Popescul, L. Ungar, and D. Pennock, "Methods and metrics for cold-start recommendations," in Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval. ACM New York, NY, USA, 2002, pp. 253-260.
14. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA, USA: The M.I.T. Press, 1963.
15. L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan, "Group formation in large social networks: membership, growth, and evolution," in Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 2006, pp. 44-54.
16. D. Crandall, D. Cosley, D. Huttenlocher, J. Kleinberg, and S. Suri, "Feedback effects between similarity and social influence in online communities," in Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 2008, pp. 160-168.
17. B.-H. Kim, A. Yedla, and H. D. Pfister, "Message-passing inference on a factor graph for collaborative filtering," April 2010, [Online]. Available: http://arxiv.org/abs/1004.1003.
18. A. Gersho and R. M. Gray, Vector Quantization and Signal Compression. Norwell, MA, USA: Kluwer Academic Publishers, 1992.
19. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
20. A. Montanari, "Estimating random variables from random sparse observations," Sept. 2007, [Online]. Available: http://arxiv.org/abs/0709. 0145.
21. T. J. Richardson and R. L. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
22. [Online]. Available: http://www.ece.tamu.edu/hpfister/software/imp.