Collaborative filtering with temporal dynamics
The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Item-based collaborative filtering recommendation algorithms
Sarwar, B., Karypis, G., Konstan, J., & Riedl, J. (2001) · Proceedings of the 10th international conference on World Wide Web · doi:10.1145/371920.372071 · Cited by 9,135 · cited 1×
“An item-item approach [9, 14] evaluates the preference of a user to an item based on ratings of similar items by the same user.”
BackgroundAmazon.com recommendations: item-to-item collaborative filtering
Linden, G., Smith, B., & York, J. (2003) · IEEE Internet Computing · doi:10.1109/mic.2003.1167344 · Cited by 5,403
Factorization meets the neighborhood: a multifaceted collaborative filtering model
Koren, Y. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401944 · Cited by 3,852
Self-citationRestricted Boltzmann machines for collaborative filtering
Salakhutdinov, R., Mnih, A., & Hinton, G. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273596 · Cited by 1,885
Learning in the Presence of Concept Drift and Hidden Contexts
Widmer, G., & Kubat, M. (1996) · Machine Learning · doi:10.1023/a:1018046501280 · Cited by 1,857
Mining concept-drifting data streams using ensemble classifiers
Wang, H., Fan, W., Yu, P. S., & Han, J. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956778 · Cited by 1,256
Bennett, J. R., & Lanning, S. (2007) · Cited by 1,216
A streaming ensemble algorithm (SEA) for large-scale classification
Street, W. N., & Kim, Y. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502568 · Cited by 1,205
The problem of concept drift: definitions and related work
Tsymbal, A. (2004) · Cited by 929
Adaptive web search based on user profile constructed without any effort from users
Sugiyama, K., Hatano, K., & Yoshikawa, M. (2004) · Proceedings of the 13th international conference on World Wide Web · doi:10.1145/988672.988764 · Cited by 645
Collaborative filtering with privacy via factor analysis
Canny, J. (2002) · Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/564376.564419 · Cited by 508
Scalable Collaborative Filtering with Jointly Derived Neighborhood Interpolation Weights
Bell, R. M., & Koren, Y. (2007) · Seventh IEEE International Conference on Data Mining (ICDM 2007) · doi:10.1109/icdm.2007.90 · Cited by 499
Self-citationTime weight collaborative filtering
Ding, Y., & Li, X. (2005) · Proceedings of the 14th ACM international conference on Information and knowledge management · doi:10.1145/1099554.1099689 · Cited by 454
Dynamic weighted majority: a new ensemble method for tracking concept drift
Kolter, J. Z., & Maloof, M. A. (2004) · Third IEEE International Conference on Data Mining · doi:10.1109/icdm.2003.1250911 · Cited by 419
Modeling relationships at multiple scales to improve accuracy of large recommender systems
Bell, R., Koren, Y., & Volinsky, C. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281206 · Cited by 368
Self-citationBeyond incremental processing: tracking concept drift
Schlimmer, J. C., & Granger, R. (1986) · National Conference on Artificial Intelligence · Cited by 207
Major components of the gravity recommendation system
Takács, G., Pilászy, I., Németh, B., & Tikk, D. (2007) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1345448.1345466 · Cited by 178
Matrix factorization and neighbor based algorithms for the netflix prize problem
Takács, G., Pilászy, I., Németh, B., & Tikk, D. (2008) · Proceedings of the 2008 ACM conference on Recommender systems · doi:10.1145/1454008.1454049 · Cited by 160
Proceedings of the 2008 ACM conference on Recommender systems
(2008) · doi:10.1145/1454008 · Cited by 113
Improved neighborhood-based algorithms for large-scale recommender systems
Töscher, A., Jahrer, M., & Legenstein, R. A. (2008) · doi:10.1145/1722149.1722153 · Cited by 73
Cited by
Matrix Factorization Techniques for Recommender Systems
Koren, Y., Bell, R., & Volinsky, C. (2009) · Computer · doi:10.1109/mc.2009.263 · Cited by 11,673
Self-citationDeep Learning Based Recommender System: A Survey and New Perspectives
Zhang, S., Yao, L., Sun, A., & Tay, Y. (2020) · ACM Computing Surveys · doi:10.1145/3285029 · Cited by 3,485
Factorizing personalized Markov chains for next-basket recommendation
Rendle, S., Freudenthaler, C., & Schmidt-Thieme, L. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772773 · Cited by 2,692
Recommender systems with social regularization
Ma, H., Zhou, D., Liu, C., Lyu, M. R., & King, I. (2011) · Proceedings of the fourth ACM international conference on Web search and data mining · doi:10.1145/1935826.1935877 · Cited by 1,626
Performance of recommender algorithms on top-n recommendation tasks
Cremonesi, P., Koren, Y., & Turrin, R. (2010) · Proceedings of the fourth ACM conference on Recommender systems · doi:10.1145/1864708.1864721 · Cited by 1,410
Self-citation
Metadata
- Authors
- Koren, Y.
- Venue
- Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2009-06-28
- Pages
- 447-456
- OpenAlex
- W2080320419
- Cited by
- 1,203
- References
- 20
- FWCI
- 49.31
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.