skip to main content
research-article
Free Access

Collaborative filtering with temporal dynamics

Published:01 April 2010Publication History
Skip Abstract Section

Abstract

Customer preferences for products are drifting over time. Product perception and popularity are constantly changing as new selection emerges. Similarly, customer inclinations are evolving, leading them to ever redefine their taste. Thus, modeling temporal dynamics is essential for designing recommender systems or general customer preference models. However, this raises unique challenges. Within the ecosystem intersecting multiple products and customers, many different characteristics are shifting simultaneously, while many of them influence each other and often those shifts are delicate and associated with a few data instances. This distinguishes the problem from concept drift explorations, where mostly a single concept is tracked. Classical time-window or instance decay approaches cannot work, as they lose too many signals when discarding data instances. A more sensitive approach is required, which can make better distinctions between transient effects and long-term patterns. We show how to model the time changing behavior throughout the life span of the data. Such a model allows us to exploit the relevant components of all data instances, while discarding only what is modeled as being irrelevant. Accordingly, we revamp two leading collaborative filtering recommendation approaches. Evaluation is made on a large movie-rating dataset underlying the Netflix Prize contest. Results are encouraging and better than those previously reported on this dataset. In particular, methods described in this paper play a significant role in the solution that won the Netflix contest.

References

  1. Ali, K., van Stam, W. TiVo: making show recommendations using a distributed collaborative filtering architecture. In Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2004), 394--401. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Bell, R., Koren, Y. Scalable collaborative filtering with jointly derived neighborhood interpolation weights. IEEE International Conference on Data Mining (ICDM'07) (2007), 43--52. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Bennet, J., Lanning, S. The Netflix Prize. KDD Cup and Workshop, 2007. www.netflixprize.com.Google ScholarGoogle Scholar
  4. Ding, Y., Li, X. Time weight collaborative filtering. In Proceedings of the 14th ACM International Conference on Information and Knowledge Management (CIKM'04) (2004), 485--492. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Goldberg, D., Nichols, D., Oki, B.M., Terry, D. Using collaborative filtering to weave an information tapestry. Commun. ACM 35 (1992), 61--70. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Kolter, J.Z., Maloof, M.A. Dynamic weighted majority: A new ensemble method for tracking concept drift. In Proceedings of the IEEE Conference on Data Mining (ICDM'03) (2003), 123--130. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Koren, Y. Factorization meets the neighborhood: A multifaceted collaborative filtering model. In Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'08) (2008), 426--434. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Koren, Y. Collaborative filtering with temporal dynamics. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'09) (2009), 447--456. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Koren, Y., Bell, R., Volinsky, C. Matrix factorization techniques for recommender systems. IEEE Comput. 42 (2009), 30--37. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Linden, G., Smith, B., York, J. Amazon.com recommendations: Item-to-item collaborative filtering. IEEE Internet Comput. 7 (2003), 76--80. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Paterek, A. Improving regularized singular value decomposition for collaborative filtering. In Proceedings of the KDD Cup and Workshop (2007).Google ScholarGoogle Scholar
  12. Pu, P., Bridge, D.G., Mobasher, B., Ricci, F. (eds.). In Proceedings of the 2008 ACM Conference on Recommender Systems (2008). Google ScholarGoogle ScholarCross RefCross Ref
  13. Sarwar, B.M., Karypis, G., Konstan, J.A., Riedl, J. Application of dimensionality reduction in recommender system---A case study. WEBKDD'2000.Google ScholarGoogle Scholar
  14. Sarwar, B., Karypis, G., Konstan, J., Riedl, J. Item-based collaborative filtering recommendation algorithms. In Proceedings of the 10th International Conference on the World Wide Web (2001), 285--295. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Schlimmer, J., Granger, R. Beyond incremental processing: Tracking concept drift. In Proceedings of the 5th National Conference on Artificial Intelligence (1986), 502--507.Google ScholarGoogle Scholar
  16. Sugiyama, K., Hatano, K., Yoshikawa, M. Adaptive web search based on user profile constructed without any effort from users. In Proceedings of the 13th International Conference on World Wide Web (WWW'04) (2004), 675--684. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Takacs, G., Pilaszy, I., Nemeth, B., Tikk, D. Major components of the gravity recommendation aystem. SIGKDD Explor. 9 (2007), 80--84. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Toscher, A., Jahrer, M., Legenstein, R. Improved neighborhood-based algorithms for large-scale recommender systems. KDD'08 Workshop on Large Scale Recommenders Systems and the Netflix Prize (2008). Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Tsymbal, A. The problem of concept drift: Definitions and related work. Technical Report TCD-CS-2004-15. Trinity College Dublin, 2004.Google ScholarGoogle Scholar
  20. Widmer, G., Kubat, M. Learning in the presence of concept drift and hidden contexts. Mach. Learn. 23, 69 (1996), 101. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Collaborative filtering with temporal dynamics

    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 Communications of the ACM
      Communications of the ACM  Volume 53, Issue 4
      April 2010
      131 pages
      ISSN:0001-0782
      EISSN:1557-7317
      DOI:10.1145/1721654
      Issue’s Table of Contents

      Copyright © 2010 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: 1 April 2010

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Popular
      • Refereed

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    HTML Format

    View this article in HTML Format .

    View HTML Format