The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
A Troubling Analysis of Reproducibility and Progress in Recommender Systems Research
Open accessAbstract
The design of algorithms that generate personalized ranked item lists is a central topic of research in the field of recommender systems. In the past few years, in particular, approaches based on deep learning (neural) techniques have become dominant in the literature. For all of them, substantial progress over the state-of-the-art is claimed. However, indications exist of certain problems in today’s research practice, e.g., with respect to the choice and optimization of the baselines used for comparison, raising questions about the published claims. To obtain a better understanding of the actual progress, we have compared recent results in the area of neural recommendation approaches based on collaborative filtering against a consistent set of existing simple baselines. The worrying outcome of the analysis of these recent works—all were published at prestigious scientific conferences between 2015 and 2018—is that 11 of the 12 reproducible neural approaches can be outperformed by conceptually simple methods, e.g., based on the nearest-neighbor heuristic or linear models. None of the computationally complex neural methods was actually consistently better than already existing learning-based techniques, e.g., using matrix factorization or linear models. In our analysis, we discuss common issues in today’s research practice, which, despite the many papers that are published on the topic, have apparently led the field to a certain level of stagnation. 1
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Amazon.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
Lipton, Z. C., & Steinhardt, J. (2019) · Queue · doi:10.1145/3317287.3328534 · Cited by 231
Cited by
Wu, L., He, X., Wang, X., Zhang, K., & Wang, M. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2022.3145690 · Cited by 413
Advances in Collaborative Filtering
Koren, Y., Rendle, S., & Bell, R. (2022) · Recommender Systems Handbook · doi:10.1007/978-1-0716-2197-4_3 · Cited by 324
Evaluating Recommender Systems: Survey and Framework
Zangerle, E., & Bauer, C. (2023) · ACM Computing Surveys · doi:10.1145/3556536 · Cited by 283
Personality Bias of Music Recommendation Algorithms
Melchiorre, A. B., Zangerle, E., & Schedl, M. (2020) · Fourteenth ACM Conference on Recommender Systems · doi:10.1145/3383313.3412223 · Cited by 48
ReuseKNN: Neighborhood Reuse for Differentially Private KNN-Based Recommendations
Müllner, P., Lex, E., Schedl, M., & Kowald, D. (2023) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3608481 · Cited by 27
Metadata
- Authors
- Ferrari Dacrema, M., Boglio, S., Cremonesi, P., & Jannach, D.
- Venue
- ACM Transactions on Information Systems
- Published
- 2021-01-06
- Volume
- 39
- Issue
- 2
- Pages
- 1-49
- ISSN
- 1046-8188 (ISSN-L)
- 1558-2868
- OpenAlex
- W2987577970
- Cited by
- 199
- References
- 3
- FWCI
- 31.97
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Troubling Analysis of Reproducibility and Progress in Recommender Systems Research. https://app.cochat.ai/papers/10.1145/3434185
- The paper
- Ferrari Dacrema, M., Boglio, S., Cremonesi, P., & Jannach, D. (2021). A Troubling Analysis of Reproducibility and Progress in Recommender Systems Research. ACM Transactions on Information Systems. https://doi.org/10.1145/3434185
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.