Yehuda Koren
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 should be a key when designing recommender systems or general customer preference models. However, this raises unique challenges. Within the eco-system 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 much signal when discarding data instances. A more sensitive approach is required, which can make better distinctions between transient effects and long term patterns. The paradigm we offer is creating a model tracking the time changing behavior throughout the life span of the data. This 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 by Netflix. Results are encouraging and better than those previously reported on this dataset.
Supplemental Material
- R. Bell and Y. Koren. Scalable collaborative filtering with jointly derived neighborhood interpolation weights. IEEE International Conference on Data Mining (ICDM'07), pp. 43--52, 2007. Google Scholar
Digital Library
- R. M. Bell, Y. Koren and C. Volinsky. Modelingrelationships at multiple scales to improve accuracy of largerecommender systems. Proc. 13th ACM SIGKDD InternationalConference on Knowledge Discovery and Data Mining (KDD'07), pp. 95--104, 2007. Google ScholarDigital Library
- J. Bennett, C. Elkan, B. Liu, P. Smyth and D. Tikk (eds.). KDD Cup and Workshop in conjunction with KDD'07, 2007.Google Scholar
- J. Bennet and S. Lanning. The Netflix Prize. KDD Cup and Workshop, 2007. www.netflixprize.comGoogle Scholar
- J. Canny. Collaborative filtering with privacy via factoranalysis. Proc. 25th ACM SIGIR Conf. on Research and Development in Information Retrieval (SIGIR'02), pp. 238--245, 2002. Google ScholarDigital Library
- Y. Ding and X. Li. Time weight collaborative filtering. Proc. 14th ACM international conference on Information and knowledge management (CIKM'04), pp. 485--492, 2004. Google ScholarDigital Library
- J. Z. Kolter and M. A. Maloof. Dynamic weighted majority: A new ensemble method for tracking concept drift. Proc. IEEE Conf. on Data Mining (ICDM'03), pp. 123--130, 2003. Google ScholarDigital Library
- Y. Koren. Factorization meets the neighborhood: a multifaceted collaborative filtering model. Proc. 14th ACM SIGKDD Int.Conf. on Knowledge Discovery and Data Mining (KDD'08), pp. 426--434, 2008. Google ScholarDigital Library
- G. Linden, B. Smith and J. York. Amazon.com recommendations: Item-to-item collaborative filtering. IEEE Internet Computing, 7:76--80, 2003. Google ScholarDigital Library
- A. Paterek. Improving regularized singular value decomposition for collaborative filtering. Proc. KDD Cup and Workshop, 2007.Google Scholar
- G. Potter. Putting the collaborator back into collaborative filtering. KDD'08 Workshop on Large Scale Recommenders Systems and the Netflix Prize, 2008. Google ScholarDigital Library
- P. Pu, D. G. Bridge, B. Mobasher and F. Ricci (eds.). Proc. 2008 ACM Conference on Recommender Systems, 2008. Google ScholarCross Ref
- R. Salakhutdinov, A. Mnih and G. Hinton. RestrictedBoltzmann Machines for collaborative filtering. Proc. 24th AnnualInternational Conference on Machine Learning, pp. 791--798, 2007. Google ScholarDigital Library
- B. Sarwar, G. Karypis, J. Konstan and J. Riedl. Item-based collaborative filtering recommendation algorithms. Proc. 10th International Conference on the World Wide Web, pp. 285--295, 2001. Google ScholarDigital Library
- J. Schlimmer and R. Granger. Beyond incremental processing: Tracking concept drift. Proc. 5th National Conference on Artificial Intelligence, pp. 502--507, 1986.Google Scholar
- W. N. Street and Y. Kim. A streaming ensemble algorithm (SEA) for large-scale classification. Proc. 7th ACM SIGKDD InternationalConference on Knowledge Discovery and Data Mining (KDD'01), pp. 377--382, 2001. Google ScholarDigital Library
- K. Sugiyama, K. Hatano and M. Yoshikawa. Adaptive web search based on user profile constructed without any effort from users. Proc. 13th international conference on World Wide Web (WWW'04), pp. 675--684, 2004. Google ScholarDigital Library
- G. Takacs, I. Pilaszy, B. Nemeth and D. Tikk. Major components of the gravity recommendation aystem. SIGKDD Explorations, 9:80--84, 2007. Google ScholarDigital Library
- G. Takacs, I. Pilaszy, B. Nemeth and D. Tikk. Matrix factorization and neighbor based algorithms for the Netflix Prize problem. Proc. 2008 ACM Conference on Recommender Systems (RECSYS'08), pp. 267--274, 2008. Google ScholarDigital Library
- C. Thompson. If you liked this, you're sure to love that. The New York Times, Nov 21, 2008.Google Scholar
- A. Toscher, M. Jahrer and R. Legenstein. Improved neighborhood-based algorithms for large-scale recommender systems. KDD'08 Workshop on Large Scale Recommenders Systems and the Netflix Prize, 2008. Google ScholarDigital Library
- A. Tsymbal. The problem of concept drift: Definitions and related work. Technical Report TCD-CS-2004-15, Trinity College Dublin, 2004.Google Scholar
- A. Tuzhilin, Y. Koren, J. Bennett, C. Elkan and D. Lemire (eds.). Workshop on large scale recommender systems and the Netflix Prize in conjunction with KDD'08, 2008.Google ScholarDigital Library
- H. Wang, W. Fan, P. S. Yu, and J. Han. Mining concept driftingdata streams using ensemble classifiers. Proc. 9th ACM SIGKDD InternationalConference on Knowledge Discovery and Data Mining (KDD'03), pp. 226--235, 2003. Google ScholarDigital Library
- G. Widmer and M. Kubat. Learning in the presence of concept drift and hidden contexts. Machine Learning, 23:69--101, 1996. Google ScholarDigital Library
Index Terms
- Collaborative filtering with temporal dynamics
Recommendations
Trust-based collaborative filtering: tackling the cold start problem using regular equivalence
RecSys '18: Proceedings of the 12th ACM Conference on Recommender SystemsUser-based Collaborative Filtering (CF) is one of the most popular approaches to create recommender systems. This approach is based on finding the most relevant k users from whose rating history we can extract items to recommend. CF, however, suffers ...
Merging trust in collaborative filtering to alleviate data sparsity and cold start
Providing high quality recommendations is important for e-commerce systems to assist users in making effective selection decisions from a plethora of choices. Collaborative filtering is a widely accepted technique to generate recommendations based on ...
Collaborative filtering based on an iterative prediction method to alleviate the sparsity problem
iiWAS '09: Proceedings of the 11th International Conference on Information Integration and Web-based Applications & ServicesCollaborative filtering (CF) is one of the most popular recommender system technologies. It tries to identify users that have relevant interests and preferences by calculating similarities among user profiles. The idea behind this method is that, it may ...
Comments