The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Performance of recommender algorithms on top-n recommendation tasks
Abstract
In many commercial systems, the 'best bet' recommendations are shown, but the predicted rating values are not. This is usually referred to as a top-N recommendation task, where the goal of the recommender system is to find a few specific items which are supposed to be most appealing to the user. Common methodologies based on error metrics (such as RMSE) are not a natural fit for evaluating the top-N recommendation task. Rather, top-N performance can be directly measured by alternative methodologies based on accuracy metrics (such as precision/recall).
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“They leverage domain-specific features, such as item attributes, user behaviors, and interaction patterns, to generate recommendations that align closely with the preferences of the target users within that domain [18].”
From A Critical Review on Citation Recommendation Systems Through a Graph-Centric Approach (2026) · cites this paper as [18]
In the citing paper
“Domain-dedicated recommender systems are tailored to the characteristics and preferences specific to their respective domains.”
From A Critical Review on Citation Recommendation Systems Through a Graph-Centric Approach (2026) · cites this paper as [18]
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
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-citationItem-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 2×
“, [15]), as it usually performs better in RMSE terms, while being more scalable.”
BackgroundMethodEvaluating collaborative filtering recommender systems
Herlocker, J. L., Konstan, J. A., Terveen, L. G., & Riedl, J. T. (2004) · ACM Transactions on Information Systems · doi:10.1145/963770.963772 · Cited by 5,798 · cited 1×
“However, in many commercial systems only the ‘best bet’ recommendations are shown, while the predicted rating values are not [8].”
BackgroundFactorization 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-citation(2011) · Springer eBooks · doi:10.1007/978-0-387-85820-3 · Cited by 3,761
Collaborative Filtering for Implicit Feedback Datasets
Hu, Y., Koren, Y., & Volinsky, C. (2008) · 2008 Eighth IEEE International Conference on Data Mining · doi:10.1109/icdm.2008.22 · Cited by 3,170
Self-citationThe long tail: why the future of business is selling less of more
(2007) · Choice Reviews Online · doi:10.5860/choice.44-2783 · Cited by 2,869
Item-based top-N recommendation algorithms
Deshpande, M., & Karypis, G. (2004) · ACM Transactions on Information Systems · doi:10.1145/963770.963776 · Cited by 2,164
Application of Dimensionality Reduction in Recommender System - A Case Study
Sarwar, B., Karypis, G., Konstan, J., & Riedl, J. (2000) · doi:10.21236/ada439541 · Cited by 1,491
Bennett, J. R., & Lanning, S. (2007) · Cited by 1,216
Collaborative filtering with temporal dynamics
Koren, Y. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557072 · Cited by 1,203
Self-citationMovieLens unplugged: experiences with an occasionally connected recommender system
Miller, B. N., Albert, I., Lam, S. K., Konstan, J. A., & Riedl, J. (2003) · Proceedings of the 8th international conference on Intelligent user interfaces · doi:10.1145/604045.604094 · Cited by 508
Large-Scale Sparse Singular Value Computations
Berry, M. W. (1992) · The International Journal of Supercomputing Applications · doi:10.1177/109434209200600103 · Cited by 402
Qualitative analysis of user-based and item-based prediction algorithms for recommendation agents
Papagelis, M., & Plexousakis, D. (2005) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2005.06.010 · Cited by 183
From hits to niches?: or how popular artists can bias music recommendation and discovery
Celma, Ò., & Cano, P. (2008) · Proceedings of the 2nd KDD Workshop on Large-Scale Recommender Systems and the Netflix Prize Competition · doi:10.1145/1722149.1722154 · Cited by 170
An Evaluation Methodology for Collaborative Recommender Systems
Cremonesi, P., Turrin, R., Lentini, E., & Matteucci, M. (2008) · International Conference on Automated Production of Cross Media Content for Multi-Channel Distribution · doi:10.1109/axmedis.2008.13 · Cited by 110
Self-citationA Recommender System for an IPTV Service Provider: a Real Large-Scale Production Environment
Bambini, R., Cremonesi, P., & Turrin, R. (2010) · Springer eBooks · doi:10.1007/978-0-387-85820-3_9 · Cited by 96
Self-citation
Cited by
Fast Matrix Factorization for Online Recommendation with Implicit Feedback
He, X., Zhang, H., Kan, M.-Y., & Chua, T.-S. (2016) · Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval · doi:10.1145/2911451.2911489 · Cited by 988
Shi, Y., Larson, M., & Hanjalic, A. (2014) · ACM Computing Surveys · doi:10.1145/2556270 · Cited by 806
Explicit factor models for explainable recommendation based on phrase-level sentiment analysis
Zhang, Y., Lai, G., Zhang, M., Zhang, Y., Liu, Y., & Ma, S. (2014) · Proceedings of the 37th international ACM SIGIR conference on Research & development in information retrieval · doi:10.1145/2600428.2609579 · Cited by 791
SLIM: Sparse Linear Methods for Top-N Recommender Systems
Ning, X., & Karypis, G. (2011) · 2011 IEEE 11th International Conference on Data Mining · doi:10.1109/icdm.2011.134 · Cited by 714
FISM: factored item similarity models for top-N recommender systems
Kabbur, S., Ning, X., & Karypis, G. (2013) · Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2487575.2487589 · Cited by 651
Metadata
- Authors
- Cremonesi, P., Koren, Y., & Turrin, R.
- Venue
- Proceedings of the fourth ACM conference on Recommender systems
- Publisher
- ACM
- Published
- 2010-09-26
- Pages
- 39-46
- OpenAlex
- W2150886314
- Cited by
- 1,410
- References
- 17
- FWCI
- 37.78
- 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.