Comparative Study of Collaborative Filtering Algorithms
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Collaborative ltering is a rapidly advancing research area. Every year several new techniques are proposed and yet it is not clear which of the techniques work best and under what conditions. In this paper we conduct a study comparing several collaborative ltering techniques { both classic and recent state-of-the-art { in a variety of experimental contexts. Specically, we report conclusions controlling for number of items, number of users, sparsity level, performance criteria, and computational complexity. Our conclusions identify what algorithms work well and in what conditions, and contribute to both industrial deployment collaborative ltering algorithms and to the research community.
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
Cumulated gain-based evaluation of IR techniques
Järvelin, K., & Kekäläinen, J. (2002) · ACM Transactions on Information Systems · doi:10.1145/582415.582418 · Cited by 4,841
Feature weighting in content based recommendation system using social network analysis
Debnath, S., Ganguly, N., & Mitra, P. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367646 · Cited by 253
All Together Now: A Perspective on the Netflix Prize
Bell, R. M., Koren, Y., & Volinsky, C. (2010) · CHANCE · doi:10.1080/09332480.2010.10739787 · Cited by 91
Cited by
Living on the edge: The role of proactive caching in 5G wireless networks
Bastug, E., Bennis, M., & Debbah, M. (2014) · IEEE Communications Magazine · doi:10.1109/mcom.2014.6871674 · Cited by 1,146
Big data caching for networking: moving from cloud to edge
Zeydan, E., Bastug, E., Bennis, M., Kader, M. A., Karatepe, I. A., Er, A. S., & Debbah, M. (2016) · IEEE Communications Magazine · doi:10.1109/mcom.2016.7565185 · Cited by 310
Deep Learning and Blockchain-Empowered Security Framework for Intelligent 5G-Enabled IoT
Rathore, S., Park, J. H., & Chang, H. (2021) · IEEE Access · doi:10.1109/access.2021.3077069 · Cited by 112
Proactive Content Caching by Exploiting Transfer Learning for Mobile Edge Computing
Hou, T., Feng, G., Qin, S., & Jiang, W. (2017) · GLOBECOM 2017 - 2017 IEEE Global Communications Conference · doi:10.1109/glocom.2017.8254636 · Cited by 85
DeepCachNet: A Proactive Caching Framework Based on Deep Learning in Cellular Networks
Rathore, S., Ryu, J. H., Sharma, P. K., & Park, J. H. (2019) · IEEE Network · doi:10.1109/mnet.2019.1800058 · Cited by 43
Metadata
- Venue
- Proceedings of the International Conference on Knowledge Discovery and Information Retrieval
- Published
- 2012
- Pages
- 132-137
- OpenAlex
- W2156701939
- Cited by
- 95
- References
- 4
- FWCI
- 7.07
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Comparative Study of Collaborative Filtering Algorithms. https://app.cochat.ai/papers/10.5220/0004104001320137
- The paper
- Comparative Study of Collaborative Filtering Algorithms. (2012). Proceedings of the International Conference on Knowledge Discovery and Information Retrieval. https://doi.org/10.5220/0004104001320137
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.