skip to main content
research-article

Lessons from the Netflix prize challenge

Published:01 December 2007Publication History
Skip Abstract Section

Abstract

This article outlines the overall strategy and summarizes a few key innovations of the team that won the first Netflix progress prize.

References

  1. ACM SIGKDD, "KDD Cup and Workshop 2007", www.cs.uic.edu/~liub/Netflix-KDD-Cup-2007.html. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. R. M. Bell and Y. Koren, "Improved Neighborhood-based Collaborative Filtering", Proc. KDD-Cup and Workshop at the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2007.Google ScholarGoogle Scholar
  3. R. M. Bell and Y. Koren, "Scalable Collaborative Filtering with Jointly Derived Neighborhood Interpolation Weights", Proc. IEEE International Conference on Data Mining (ICDM'07), 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. R. M. Bell, Y. Koren and C. Volinsky, "Modeling Relationships at Multiple Scales to Improve Accuracy of Large Recommender Systems", Proc. 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. J. Bennett and S. Lanning, "The Netflix Prize", Proc. KDD-Cup and Workshop at the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2007.Google ScholarGoogle Scholar
  6. S. Funk, "Netflix Update: Try This At Home", http://sifter.org/~simon/journal/20061211.html, 2006.Google ScholarGoogle Scholar
  7. J. L. Herlocker, J. A. Konstan, A. Borchers and J. Riedl, "An Algorithmic Framework for Performing Collaborative Filtering", Proc. 22nd ACM SIGIR Conference on Information Retrieval, pp. 230--237, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Netflix, Inc., "Netflix Prize: Forum", www.netflixprize.com//community/.Google ScholarGoogle Scholar
  9. A. Paterek, "Improving Regularized Singular Value Decomposition for Collaborative Filtering", Proc. KDD-Cup and Workshop at the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2007.Google ScholarGoogle Scholar
  10. R. Salakhutdinov, A. Mnih and G. Hinton, "Restricted Boltzmann Machines for Collaborative Filtering", Proc. 24th Annual International Conference on Machine Learning (ICML'07), 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. B. Sarwar, G. Karypis, J. Konstan and J. Riedl, "Itembased Collaborative Filtering Recommendation Algorithms", Proc. 10th International Conference on the World Wide Web, pp. 285--295, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Y. Zhang and J. Koren, "Efficient Bayesian Hierarchical User Modeling for Recommendation Systems", Proc. 30th International ACM Conference on Research and Development in Information Retrieval (SIGIR'07), 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Lessons from the Netflix prize challenge

          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

          Full Access

          • Published in

            cover image ACM SIGKDD Explorations Newsletter
            ACM SIGKDD Explorations Newsletter  Volume 9, Issue 2
            Special issue on visual analytics
            December 2007
            105 pages
            ISSN:1931-0145
            EISSN:1931-0153
            DOI:10.1145/1345448
            Issue’s Table of Contents

            Copyright © 2007 Authors

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 December 2007

            Check for updates

            Qualifiers

            • research-article

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader