Dynamic matrix factorization with priors on unknown values

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn 2015-August, Issue , 2015, Pages 189-198

  Devooght, Robin ^a   Kourtellis, Nicolas ^b   Mantrach, Amin ^c  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b TELEFONICA RESEARCH   (Spain)

^c YAHOO RESEARCH   (United States)

Author keywords

Collaborative filtering; Dynamic matrix factorization; Recommender systems

Indexed keywords

COLLABORATIVE FILTERING; DATA MINING; FACTORIZATION; RECOMMENDER SYSTEMS;

COLLABORATIVE FILTERING METHODS; EXPLICIT FEEDBACK; LARGE DATASETS; MATRIX FACTORIZATIONS; MISSING AT RANDOMS; STATE OF THE ART; STATIC AND DYNAMIC CONDITIONS; TIME INDEPENDENTS;

MATRIX ALGEBRA;

EID: 84954158205     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2783258.2783346     Document Type: Conference Paper

References (29)

1. S. Balakrishnan and S. Chopra. Collaborative ranking. In Proc. of the 5th ACM WSDM, pages 143-152, 2012.
2. S. Boyd and L. Vandenberghe. Convex optimization. Cambridge University Press, 2009.
3. W.-S. Chin, Y. Zhuang, Y.-C. Juan, and C.-J. Lin. A fast parallel stochastic gradient method for matrix factorization in shared memory systems. ACM TIST, 6(1):2, 2015.
4. P. Cremonesi, Y. Koren, and R. Turrin. Performance of recommender algorithms on top-n recommendation tasks. In Proc. of the 4th ACM RecSys, pages 39-46, 2010.
5. J. Dean, G. Corrado, R. Monga, K. Chen, M. Devin, M. Mao, A. Senior, P. Tucker, K. Yang, Q. V. Le, et al. Large scale distributed deep networks. In Advances in Neural Information Processing Systems, pages 1223-1231, 2012.
6. J. Duchi, E. Hazan, and Y. Singer. Adaptive subgradient methods for online learning and stochastic optimization. The Journal of Machine Learning Research, 12:2121-2159, 2011.
7. J. Gaillard and J.-M. Renders. Time-sensitive collaborative filtering through adaptive matrix completion. In Advances in Information Retrieval, pages 327-332. Springer, 2015.
8. R. Gemulla, E. Nijkamp, P. J. Haas, and Y. Sismanis. Large-scale matrix factorization with distributed stochastic gradient descent. In Proc. of the 17th ACM SIGKDD, pages 69-77, 2011.
9. D. Goldberg, D. Nichols, B. M. Oki, and D. Terry. Using collaborative filtering to weave an information tapestry. Communications of the ACM, 35(12):61-70, 1992.
10. Y. Hu, Y. Koren, and C. Volinsky. Collaborative filtering for implicit feedback datasets. In Proc. of the 8th IEEE ICDM, pages 263-272, 2008.
11. Y. Koren, R. Bell, and C. Volinsky. Matrix factorization techniques for recommender systems. Computer, 42(8):30-37, 2009.
12. A. Kyrola, G. E. Blelloch, and C. Guestrin. GraphChi: Large-scale graph computation on just a pc. In OSDI, Volume 12, pages 31-46, 2012.
13. D. D. Lee and H. S. Seung. Algorithms for non-negative matrix factorization. In Advances in neural information processing systems, pages 556-562, 2000.
14. J. Lee, S. Bengio, S. Kim, G. Lebanon, and Y. Singer. Local collaborative ranking. In Proc. of the 23rd ACM WWW, pages 85-96, 2014.
15. C.-J. Lin. Projected gradient methods for nonnegative matrix factorization. Neural computation, 19(10):2756-2779, 2007.
16. R. J. Little and D. B. Rubin. Statistical analysis with missing data. Wiley, 2002.
17. B. Marlin, R. S. Zemel, S. Roweis, and M. Slaney. Collaborative filtering and the missing at random assumption. In Proc. of the 23rd UAI Conference, 2007.
18. J. McAuley and J. Leskovec. Hidden factors and hidden topics: understanding rating dimensions with review text. In Proc. of the 7th ACM RecSys, pages 165-172, 2013.
19. R. Pan and M. Scholz. Mind the gaps: weighting the unknown in large-scale one-class collaborative filtering. In Proc. of the 15th ACM SIGKDD, pages 667-676, 2009.
20. R. Pan, Y. Zhou, B. Cao, N. N. Liu, R. Lukose, M. Scholz, and Q. Yang. One-class collaborative filtering. In Proc. of the 8th IEEE ICDM, pages 502-511, 2008.
21. S. Rendle. Factorization machines. In Proc. of ICDM 2010, pages 995-1000, 2010.
22. S. Rendle, C. Freudenthaler, Z. Gantner, and L. Schmidt-Thieme. Bpr: Bayesian personalized ranking from implicit feedback. In Proc. of the 25th Conference on Uncertainty in Artificial Intelligence, pages 452-461. AUAI Press, 2009.
23. S. Rendle and L. Schmidt-Thieme. Online-updating regularized kernel matrix factorization models for large-scale recommender systems. In Proc. of the ACM Rec-Sys, pages 251-258, 2008.
24. P. Resnick, N. Iacovou, M. Suchak, P. Bergstrom, and J. Riedl. Grouplens: an open architecture for collaborative filtering of netnews. In Proc. of ACM CSCW, pages 175-186, 1994.
25. P. Richtárik and M. Takáč. Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function. Mathematical Programming, 144(1-2):1-38, 2014.
26. V. Sindhwani, S. S. Bucak, J. Hu, and A. Mojsilovic. One-class matrix completion with low-density factorizations. In Proc. of the 10th IEEE ICDM, pages 1055-1060, 2010.
27. H. Steck. Training and testing of recommender systems on data missing not at random. In Proc. of the 16th ACM SIGKDD, pages 713-722, 2010.
28. K. Weinberger, A. Dasgupta, J. Langford, A. Smola, and J. Attenberg. Feature hashing for large scale multitask learning. In Proc. of the 26th ACM ICML, pages 1113-1120, 2009.
29. Y. Zhou, D. Wilkinson, R. Schreiber, and R. Pan. Large-scale parallel collaborative filtering for the net-flix prize. In Algorithmic Aspects in Information and Management, pages 337-348. Springer, 2008.