Fetching the paper…
Reading the bibliography…
This paper introduces a novel message-passing (MP) framework for the collaborative filtering (CF) problem associated with recommender systems.
“Information Geometry and Alternating Minimization Procedures”,
I. Csiszar and G. Tusnady · 1984
Earlier work this paper cites.
A. Das, A.V. Rao, and A. Gersho, “Variable-dimension Vector Quantization of Speech Spectra for Low-rate Vocoders”, in Proc. Data Compression Conference , 1994
1994
Earlier work this paper cites.
N. Alon, “Tools from Higher Algebra”, in Handbook of Combinatorics , North Holland, 1995
1995
Earlier work this paper cites.
“A View of the EM Algorithm that Justifies Incremental, Sparse, and Other Variants”,
R. M. Neal, G. E. Hinton · 1998
Earlier work this paper cites.
“Probabilistic Latent Semantic Analysis”,
T. Hofmann, · 1999
Earlier work this paper cites.
T. Richardson and R. Urbanke, “The Capacity of Low-density Parity-check Codes under Message-passing Decoding”, in IEEE Trans. Inform. Theory , vol. 47, pp. 599–618, Feb. 2001
2001
Earlier work this paper cites.
J. Yedidia, W.T. Freeman and Y. Weiss, “Understanding Belief Propagation and Its Generalizations”, in Advances in neural information processing systems , 13, MIT, 2001
2001
Earlier work this paper cites.
A. I. Schein, Al. Popescul, L. H. Ungar, D. M. 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, pp. 253–260, August 2002
2002
Cited alongside, same era.
David MacKay, Information Theory, Inference, and Learning Algorithms, Cambridge, 2005
2005
Cited alongside, same era.
N. Srebro, N. Alon and T. Jaakkola, “Generalization Error Bounds for Collaborative Prediction with Low-Rank Matrices”, in Advances in Neural Information Processing Systems , 17, 2005
2005
Cited alongside, same era.
“Challenges in Statistical Machine Learning”,
J. Lafferty and L. Wasserman · 2006
Cited alongside, same era.
KDD Cup and Workshop 2007
ACM SIGKDD · 2007
Cited alongside, same era.
A. Montanari, “Estimating Random Variables from Random Sparse Observations”, in Eur. Trans. Telecom, Vol. 19 (4), pp. 385-403, April 2008
2008
Later among the works it cites.
R. Salakhutdinov and A. Mnih, “Probabilistic Matrix Factorization”, in Advances in Neural Information Processing Systems, 20, MIT, 2008
2008
Later among the works it cites.
J. Cai, E. Candes, and Z. Shen, “A singular value thresholding algorithm for matrix completion”, Arxiv preprint math.OC/0810.3286 , 2008
2008
Later among the works it cites.
S. T. Aditya, Onkar Dabeer and Bikash Kumar Dey, “A Channel Coding Perspective of Recommendation Systems,” in Proc. 2009 IEEE Int’l. Symp. Information Theory , Seoul, Korea, Jun. 2009
2009
Later among the works it cites.
“An Information-theoretic Approach to Collaborative Filtering”,
B.-H. Kim, · 2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
R. Keshavan, A. Montanari and S. Oh. Learning, “Learning Low Rank Matrices from O (n) Entries,” in Proc. Allerton Conf. on Comm., Control and Computing , Monticello, Illinois, Sep. 2008
2008
Cited alongside, same era.
Probabilistic Graphical Models: Principles and Techniques, Draft, 2008
D. Koller and N. Friedman · 2008
Cited alongside, same era.
Netflix prize website: http://www.netflixprize.com
Cited in the paper.
S. Funk, “Netflix update: Try this at home” at http://sifter.org/~simon/journal/20061211.html
Cited in the paper.
R. Keshavan, S. Oh, and A. Montanari, “Matrix completion from noisy entries”, Arxiv preprint cs.IT/0906.2027 , 2009
2009
Later among the works it cites.
W. Dai, and O. Milenkovic, “SET: an algorithm for consistent matrix completion”, Arxiv preprint cs.IT/0909.2705 , 2009
2009
Later among the works it cites.