Fast ALS-based matrix factorization for explicit and implicit feedback datasets

RecSys'10 - Proceedings of the 4th ACM Conference on Recommender Systems

Volumn , Issue , 2010, Pages 71-78

  Pilászy, István ^a   Zibriczky, Dávid ^a   Tikk, Domonkos ^b,c  

^a Gravity Research and Development Inc   (Hungary)

^b HUMBOLDT UNIVERSITY   (Germany)

^c BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

Alternating least squares; Collaborative filtering; Com putational complexity; Implicit and explicit feedback; Matrix factorization; Ridge regression

Indexed keywords

ALTERNATING LEAST SQUARES; COLLABORATIVE FILTERING; EXPLICIT FEEDBACK; MATRIX FACTORIZATIONS; RIDGE REGRESSION;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FACTORIZATION; REGRESSION ANALYSIS; SIGNAL FILTERING AND PREDICTION;

MATRIX ALGEBRA;

EID: 78649966572     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1864708.1864726     Document Type: Conference Paper

References (13)

1. R. Bell, Y. Koren, and C. Volinsky. Modeling relationships at multiple scales to improve accuracy of large recommender systems. In KDD-07, 13th ACM Int. Conf. on Knowledge Discovery and Data Mining, pages 95-104, New York, NY, USA, 2007. ACM.
2. R. M. Bell and Y. Koren. Scalable collaborative filtering with jointly derived neighborhood interpolation weights. In ICDM-07, 7th IEEE Int. Conf. on Data Mining, pages 43-52, Omaha, Nebraska, USA, 2007.
3. R. M. Bell, Y. Koren, and C. Volinsky. The BellKor solution to the Netflix Prize. Technical Report, AT&T Labs Research, 2007.
4. J. Bennett and S. Lanning. The Netflix Prize. In KDD Cup Workshop at KDD-07, 13th ACM Int. Conf. on Knowledge Discovery and Data Mining, pages 3-6, San Jose, California, USA, 2007.
5. S. Funk. Netflix update: Try this at home, 2006. http://sifter.org/ ~simon/journal/20061211.html.
6. J. Herlocker, J. A. Konstan, and J. Riedl. An empirical analysis of design choices in neighborhood-based collaborative flltering algorithms. Inf. Retr., 5(4):287-310, 2002.
7. th IEEE Int. Conf. on Data Mining, pages 263-272, Pisa, Italy, 2008.
8. Y. Koren. Factorization meets the neighborhood: a multifaceted collaborative flltering model. In KDD-08: 13th ACM Int. Conf. on Knowledge Discovery and Data Mining, pages 426-434, New York, NY, USA, 2008.
9. A. Paterek. Improving regularized singular value decomposition for collaborative flltering. In KDD Cup Workshop at KDD-07, 13th ACM Int. Conf. on Knowledge Discovery and Data Mining, pages 39-42, San Jose, California, USA, 2007.
10. I. Pilászy and D. Tikk. Computational complexity reduction for factorization-based collaborative filtering algorithms. In EC-Web-09: 10th Int. Conf. on Electronic Commerce and Web Technologies, pages 229-239, 2009.
11. G. Takács, I. Pilászy, B. Németh, and D. Tikk. Scalable collaborative filtering approaches for large recommender systems. Journal of Machine Learning Research, 10:623-656, 2009.
12. G. Takács, I. Pilászy, B. Németh, and D. Tikk. Investigation of various matrix factorization methods for large recommender systems. In 2nd Netflix-KDD Workshop at KDD-08: 14th ACM Int. Conf. on Knowledge Discovery and Data Mining, Las Vegas, NV, USA, August 24, 2008.
13. Y. Zhou, D. Wilkinson, R. Schreiber, and R. Pan. Large-scale parallel collaborative filtering for the Netflix Prize. In AAIM-08: 4th Int. Conf. on Algorithmic Aspects in Information and Management, pages 337-348, Berlin, Heidelberg, 2008. Springer-Verlag.