skip to main content
10.1145/1454008.1454049acmconferencesArticle/Chapter ViewAbstractPublication PagesrecsysConference Proceedingsconference-collections
poster

Matrix factorization and neighbor based algorithms for the netflix prize problem

Authors Info & Claims
Published:23 October 2008Publication History

ABSTRACT

Collaborative filtering (CF) approaches proved to be effective for recommender systems in predicting user preferences in item selection using known user ratings of items. This subfield of machine learning has gained a lot of popularity with the Netflix Prize competition started in October 2006. Two major approaches for this problem are matrix factorization (MF) and the neighbor based approach (NB). In this work, we propose various variants of MF and NB that can boost the performance of the usual ensemble based scheme. First, we investigate various regularization scenarios for MF. Second, we introduce two NB methods: one is based on correlation coefficients and the other on linear least squares. At the experimentation part, we show that the proposed approaches compare favorably with existing ones in terms of prediction accuracy and/or required training time. We present results of blending the proposed methods.

References

  1. R. M. Bell and Y. Koren. Scalable Collaborative Filtering with Jointly Derived Neighborhood Interpolation Weights. In Proc of. ICDM, IEEE International Conference on Data Mining, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. R. M. Bell, Y. Koren, and C. Volinsky. The BellKor solution to the Net Flix Prize. Technical report, AT&T Labs Research, 2007. http://www.netflixprize.com/assets/ProgressPrize2007_KorBell.pdf.Google ScholarGoogle Scholar
  3. J. Bennett, C. Eklan, B. Liu, P. Smyth, and D. Tikk. KDD Cup and Workshop 2007. ACM SIGKDD Explorations Newsletter, 9(2):51--52, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. J. Bennett and S. Lanning. The Net Flix Prize. In Proc. of KDD Cup Workshop at SIGKDD'07, 13th ACM Int. Conf. on Knowledge Discovery and Data Mining, pages 3--6, San Jose, CA, USA, 2007.Google ScholarGoogle Scholar
  5. J. S. Breese, D. Heckerman, and C. Kadie. Empirical analysis of predictive algorithms for collaborative filtering. In Proc. of UAI'98, 14th Conference on Uncertainty in Artificial Intelligence, pages 43--52. Morgan-Kaufmann, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. Canny. Collaborative filtering with privacy via factor analysis. In Proc. of SIGIR'02: 25th ACM SIGIR Conf. on Research and Development in Information Retrieval, pages 238--245, Tampere, Finland, 2002. ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. T. Hofmann. Latent semantic models for collaborative filtering. ACM Trans. Inf. Syst., 22(1):89--115, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. A. Paterek. Improving regularized singular value decomposition for collaborative filtering. In Proc. of KDD Cup Workshop at SIGKDD'07, 13th ACM Int. Conf. on Knowledge Discovery and Data Mining, pages 39--42, San Jose, CA, USA, 2007.Google ScholarGoogle Scholar
  10. D. M. Pennock, E. Horvitz, S. Lawrence, and C. L. Giles. Collaborative filtering by personality diagnosis: A hybrid memory and model-based approach. In Proc. of UAI'00: 16th Conf. on Uncertainty in Artificial Intelligence, pages 473--480, Stanford, CA, USA, 2000. Morgan Kaufmann. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. A. M. Rashid, S. K. Lam, G. Karypis, and J. Riedl. ClustKNN: a highly scalable hybrid model-& memory-based CF algorithm. In Proc. of WebKDD'06: KDD Workshop on Web Mining and Web Usage Analysis, at 12th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, Philadelphia, PA, USA, 2006.Google ScholarGoogle Scholar
  12. P. Resnick, N. Iacovou, M. Suchak, P. Bergstrom, and J. Riedl. GroupLens: An open architecture for collaborative filtering of netnews. In Proc. of CSCW'94, ACM Conference on Computer Supported Cooperative Work, pages 175--186, Chapel Hill, North Carolina, United States, 1994. ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. R. Salakhutdinov and A. Mnih. Probabilistic matrix factorization. In J. C. Platt, D. Koller, Y. Singer, and S. Roweis, editors, Advances in Neural Information Processing Systems 20, Cambridge, MA, 2008. MIT Press.Google ScholarGoogle Scholar
  14. R. Salakhutdinov, A. Mnih, and G. Hinton. Restricted Boltzmann machines for collaborative filtering. In Proc. of ICML'07, the 24th Int. Conf. on Machine Learning, pages 791--798, Corvallis, OR, USA, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. B. M. Sarwar, G. Karypis, J. A. Konstan, and J. Riedl. Application of dimensionality reduction in recommender system - a case study. In Proc. of WebKDD'00: Web Mining for E-Commerce Workshop, at 6th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, Boston, MA, USA, 2000.Google ScholarGoogle ScholarCross RefCross Ref
  16. B. M. Sarwar, G. Karypis, J. A. Konstan, and J. Riedl. Item-based collaborative filtering recommendation algorithms. In Proc. of WWW'01: 10th Int. Conf. on World Wide Web, pages 285--295, Hong Kong, 2001. ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. N. Srebro, J. D. M. Rennie, and T. S. Jaakkola. Maximum-margin matrix factorization. Advances in Neural Information Processing Systems, 17, 2005.Google ScholarGoogle Scholar
  18. G. Takács, I. Pilászy, B. Németh, and D. Tikk. On the Gravity recommendation system. In Proc. of KDD Cup Workshop at SIGKDD'07, 13th ACM Int. Conf. on Knowledge Discovery and Data Mining, pages 22--30, San Jose, CA, USA, 2007.Google ScholarGoogle Scholar
  19. M. G. Vozalis and K. G. Margaritis. Using SVD and demographic data for the enhancement of generalized Collaborative Filtering. Information Sciences, 177(15):3017--3037, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Matrix factorization and neighbor based algorithms for the netflix prize problem

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          RecSys '08: Proceedings of the 2008 ACM conference on Recommender systems
          October 2008
          348 pages
          ISBN:9781605580937
          DOI:10.1145/1454008

          Copyright © 2008 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 23 October 2008

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • poster

          Acceptance Rates

          Overall Acceptance Rate254of1,295submissions,20%

          Upcoming Conference

          RecSys '24
          18th ACM Conference on Recommender Systems
          October 14 - 18, 2024
          Bari , Italy

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader