The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Surprise: A Python library for recommender systems
Open accessAbstract
Recommender systems aim at providing users with a list of recommendations of items that a service offers.For example, a video streaming service will typically rely on a recommender system to propose a personalized list of movies or series to each of its users.A typical problem in recommendation is that of rating prediction: given an incomplete dataset of useritem interations which take the form of numerical ratings (e.g. on a scale from 1 to 5), the goal is to predict the missing ratings for all remaining user-item pairs.
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
Scikit-learn: Machine Learning in Python
Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Müller, A., Nothman, J., Louppe, G., et al. (2012) · arXiv · doi:10.48550/arxiv.1201.0490 · Cited by 71,016
Matrix Factorization Techniques for Recommender Systems
Koren, Y., Bell, R., & Volinsky, C. (2009) · Computer · doi:10.1109/mc.2009.263 · Cited by 11,673
Data Structures for Statistical Computing in Python
McKinney, W. (2010) · Proceedings of the Python in Science Conference · doi:10.25080/majora-92bf1922-00a · Cited by 11,032
The NumPy Array: A Structure for Efficient Numerical Computation
van der Walt, S., Colbert, S. C., & Varoquaux, G. (2011) · Computing in Science & Engineering · doi:10.1109/mcse.2011.37 · Cited by 9,381
ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
Lee, D. D., & Seung, H. S. (2000) · Cited by 7,952
ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
Seung, D., & Lee, L.-W. (2001) · Cited by 4,753
The MovieLens Datasets: History and Context
Harper, F. M., & Konstan, J. A. (2016) · ACM Transactions on Interactive Intelligent Systems · doi:10.1145/2827872 · Cited by 3,907
Cython: The Best of Both Worlds
Behnel, S., Bradshaw, R., Citro, C., Dalcin, L., Seljebotn, D. S., & Smith, K. (2011) · Computing in Science & Engineering · doi:10.1109/mcse.2010.118 · Cited by 1,230
Aggarwal, C. C. (2016) · Springer eBooks · doi:10.1007/978-3-319-29659-3 · Cited by 931
MyMediaLite: a free recommender system library
Gantner, Z., Rendle, S., Freudenthaler, C., & Schmidt-Thieme, L. (2011) · Proceedings of the fifth ACM conference on Recommender systems · doi:10.1145/2043932.2043989 · Cited by 368
Cited by
RecBole: Towards a Unified, Comprehensive and Efficient Framework for Recommendation Algorithms
Zhao, W. X., Mu, S., Hou, Y., Lin, Z., Chen, Y., Pan, X., Li, K., Lu, Y., Wang, H., Tian, C., et al. (2021) · Proceedings of the 30th ACM International Conference on Information & Knowledge Management · doi:10.1145/3459637.3482016 · Cited by 455
Evaluating Recommender Systems: Survey and Framework
Zangerle, E., & Bauer, C. (2023) · ACM Computing Surveys · doi:10.1145/3556536 · Cited by 283
Misztal-Radecka, J., & Indurkhya, B. (2021) · Information Processing & Management · doi:10.1016/j.ipm.2021.102519 · Cited by 29
A bias detection tree approach for detecting disparities in a recommendation model’s errors
Misztal-Radecka, J., & Indurkhya, B. (2023) · User Modeling and User-Adapted Interaction · doi:10.1007/s11257-022-09334-x · Cited by 4
Metadata
- Authors
- Hug, N.
- Venue
- Journal of Open Source Software
- Publisher
- The Open Journal
- Published
- 2020-08-05
- Volume
- 5
- Issue
- 52
- Pages
- 2174
- ISSN
- 2475-9066 (ISSN-L)
- OpenAlex
- W3047010778
- Cited by
- 264
- References
- 13
- FWCI
- 39.05
- Type
- journal article
- Language
- en
- Open access
- diamond
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: Surprise: A Python library for recommender systems. https://app.cochat.ai/papers/10.21105/joss.02174
- The paper
- Hug, N. (2020). Surprise: A Python library for recommender systems. Journal of Open Source Software. https://doi.org/10.21105/joss.02174
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.