The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
A Survey of Collaborative Filtering Techniques
Open accessAbstract
As one of the most successful approaches to building recommender systems, collaborative filtering (CF) uses the known preferences of a group of users to make recommendations or predictions of the unknown preferences for other users. In this paper, we first introduce CF tasks and their main challenges, such as data sparsity, scalability, synonymy, gray sheep, shilling attacks, privacy protection, etc., and their possible solutions. We then present three main categories of CF techniques: memory-based, model-based, and hybrid CF algorithms (that combine CF with other recommendation techniques), with examples for representative algorithms of each category, and analysis of their predictive performance and their ability to address the challenges. From basic techniques to the state-of-the-art, we attempt to present a comprehensive survey for CF techniques, which can be served as a roadmap for research and practice in this area.
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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Multiple Imputation for Nonresponse in Surveys
Rubin, D. B. (1987) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316696 · Cited by 20,701
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Sampling-based approaches to calculating marginal densities
Gelfand, A. E., & Smith, A. F. M. (1990) · Journal of the American Statistical Association · doi:10.1080/01621459.1990.10476213 · Cited by 6,606
Friedman, N., Geiger, D., & Goldszmidt, M. (1997) · Machine Learning · doi:10.1023/a:1007465528199 · Cited by 4,742
Ankerst, M. (1999) · doi:10.1145/304181.304187 · Cited by 3,982
A Simple Generalisation of the Area Under the ROC Curve for Multiple Class Classification Problems
Hand, D. J., & Till, R. J. (2001) · Machine Learning · doi:10.1023/a:1010920819831 · Cited by 2,276
Research works printed but not linked: 48
- 1992, Communications of ACM, 35, 61, 10.1145/138859.138867 · DOI · Paper page
- 1997, Communications of the ACM, 40, 56, 10.1145/245108.245121 · DOI · Paper page
- 10.1023/A:1011419012209 · DOI · Paper page
- 10.1145/1010614.1010618 · DOI · Paper page
- 2003, IEEE Internet Computing, 7, 76, 10.1109/MIC.2003.1167344 · DOI · Paper page
- 10.1145/963770.963774 · DOI · Paper page
- 2000, Journal of Marketing Research, 37, 363, 10.1509/jmkr.37.3.363.18779 · DOI · Paper page
- 2005, Journal of Machine Learning Research, 6, 1265
- 2002, A maximum entropy approach to collaborative filtering in dynamic, sparse, high-dimensional domains, 1441
- 10.1109/TKDE.2005.99 · DOI · Paper page
- 10.1109/TKDE.2004.1264822 · DOI · Paper page
- 1990, Journal of the American Society for Information Science, 41, 391, 10.1002/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9 · DOI
- 1901, Philosophical Magazine, 2, 559
- 10.1007/s10994-005-0469-0 · DOI
- 10.1145/963770.963775 · DOI · Paper page
- 2005, Maximum-margin matrix factorization, 17, 1329
- 2004, Intelligent Data Analysis, 8, 563, 10.3233/IDA-2004-8604 · DOI
- 1995, SIAM Review, 37, 573, 10.1137/1037127 · DOI · Paper page
- 2002, Information Processing Society of Japan, 43
- 1972, Journal of Documentation, 28, 11, 10.1108/eb026526 · DOI · Paper page
- 10.1145/1031114.1031116 · DOI · Paper page
- 10.1002/1098-111X(200008)15:8<745::AID-INT4>3.0.CO;2-V · DOI
- 10.1145/963770.963772 · DOI · Paper page
- 10.1145/963770.963776 · DOI · Paper page
- 10.1023/B:INRT.0000048492.50961.a6 · DOI
- 1988, Journal of Business & Economic Statistics, 6, 287, 10.1080/07350015.1988.10509663 · DOI · Paper page
- 10.1007/BF00994017 · DOI
- 1997, Machine Learning, 29, 131
- 2001, Journal of Machine Learning Research, 1, 49
- 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence, 6, 721
- 10.1007/s10115-003-0123-8 · DOI
- 10.1023/A:1017932429737 · DOI · Paper page
- 10.1023/A:1007617005950 · DOI · Paper page
- 2003, Modeling user rating profiles for collaborative filtering
- 2003, Journal of Machine Learning Research, 3, 993
- 1999, Journal of Artificial Intelligence Research, 10, 243, 10.1613/jair.587 · DOI · Paper page
- 2006, Knowledge and Information Systems, 10, 357, 10.1007/s10115-006-0002-1 · DOI
- 1999, Journal of the Royal Statistical Society. Series B, 21, 611
- 10.1007/s10791-008-9060-1 · DOI
- 10.1145/1361684.1361689 · DOI
- 1999, Artificial Intelligence Review, 13, 393
- 1997, Machine Learning, 27, 313, 10.1023/A:1007369909943 · DOI · Paper page
- 1997, Artificial Intelligence Magazine, 18, 37
- 10.1023/A:1021240730564 · DOI · Paper page
- 1997, Communications of the ACM, 40, 66, 10.1145/245108.245124 · DOI · Paper page
- 1998, User Modelling and User-Adapted Interaction, 8, 71
- 1995, Journal of the American Society for Information Science, 46, 133, 10.1002/(SICI)1097-4571(199503)46:2<133::AID-ASI6>3.0.CO;2-Z · DOI
- 10.1002/asi.10372 · DOI
Cited by
Deep Neural Networks for YouTube Recommendations
Covington, P., Adams, J., & Sargin, E. (2016) · Proceedings of the 10th ACM Conference on Recommender Systems · doi:10.1145/2959100.2959190 · Cited by 3,539
TRY – a global database of plant traits
KATTGE, J., DÍAZ, S., LAVOREL, S., PRENTICE, I. C., LEADLEY, P., BÖNISCH, G., GARNIER, E., WESTOBY, M., REICH, P. B., WRIGHT, I. J., et al. (2011) · Global Change Biology · doi:10.1111/j.1365-2486.2011.02451.x · Cited by 2,638
Power to the People: The Role of Humans in Interactive Machine Learning
Amershi, S., Cakmak, M., Knox, W. B., & Kulesza, T. (2014) · AI Magazine · doi:10.1609/aimag.v35i4.2513 · Cited by 1,084
Bringing Big Data to Personalized Healthcare: A Patient-Centered Framework
Chawla, N. V., & Davis, D. A. (2013) · Journal of General Internal Medicine · doi:10.1007/s11606-013-2455-8 · Cited by 440
Too much, too little, or just right? Ways explanations impact end users' mental models
Kulesza, T., Stumpf, S., Burnett, M., Yang, S., Kwan, I., & Wong, W.-K. (2013) · 2013 IEEE Symposium on Visual Languages and Human Centric Computing · doi:10.1109/vlhcc.2013.6645235 · Cited by 388
Metadata
- Authors
- Su, X., & Khoshgoftaar, T. M.
- Venue
- Advances in Artificial Intelligence
- Publisher
- Wiley
- Published
- 2009-10-27
- Volume
- 2009
- Pages
- 1-19
- ISSN
- 1687-7470 (ISSN-L)
- 1687-7489
- OpenAlex
- W2100235918
- Cited by
- 3,602
- References
- 7
- FWCI
- 277.17
- Type
- journal article
- Language
- en
- Open access
- hybrid
- Funders
- Florida Atlantic University
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.