The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Scalable Collaborative Filtering with Jointly Derived Neighborhood Interpolation Weights
Abstract
Recommender systems based on collaborative filtering predict user preferences for products or services by learning past user-item relationships. A predominant approach to collaborative filtering is neighborhood based ("k-nearest neighbors"), where a user-item preference rating is interpolated from ratings of similar items and/or users. We enhance the neighborhood-based approach leading to substantial improvement of prediction accuracy, without a meaningful increase in running time. First, we remove certain so-called "global effects" from the data to make the ratings more comparable, thereby improving interpolation accuracy. Second, we show how to simultaneously derive interpolation weights for all nearest neighbors, unlike previous approaches where each weight is computed separately. By globally solving a suitable optimization problem, this simultaneous interpolation accounts for the many interactions between neighbors leading to improved accuracy. Our method is very fast in practice, generating a prediction in about 0.2 milliseconds. Importantly, it does not require training many parameters or a lengthy preprocessing, making it very practical for large scale applications. Finally, we show how to apply these methods to the perceivably much slower user-oriented approach. To this end, we suggest a novel scheme for low dimensional embedding of the users. We evaluate these methods on the netflix dataset, where they deliver significantly better results than the commercial netflix cinematch recommender system.
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
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
Adomavicius, G., & Tuzhilin, A. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.99 · Cited by 10,310
(1999) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/b98874 · Cited by 9,482
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
Solving Least Squares Problems
Lawson, C. L., & Hanson, R. J. (1995) · doi:10.1137/1.9781611971217 · Cited by 7,103
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
Using collaborative filtering to weave an information tapestry
Goldberg, D., Nichols, D., Oki, B. M., & Terry, D. (1992) · Communications of the ACM · doi:10.1145/138859.138867 · Cited by 4,066
An Algorithmic Framework for Performing Collaborative Filtering
Herlocker, J. L., Konstan, J. A., Borchers, A., & Riedl, J. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130372 · Cited by 2,512
GroupLens: applying collaborative filtering to Usenet news
Konstan, J. A., Miller, B. N., Maltz, D., Herlocker, J. L., Gordon, L. R., & Riedl, J. (1997) · Communications of the ACM · doi:10.1145/245108.245126 · Cited by 2,367
An algorithmic framework for performing collaborative filtering
Herlocker, J. L., Konstan, J. A., Borchers, A., & Riedl, J. (1999) · Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/312624.312682 · Cited by 2,011
Restricted Boltzmann machines for collaborative filtering
Salakhutdinov, R., Mnih, A., & Hinton, G. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273596 · Cited by 1,885
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
Eigentaste: A Constant Time Collaborative Filtering Algorithm
Goldberg, K., Roeder, T., Gupta, D., & Perkins, C. (2001) · Information Retrieval · doi:10.1023/a:1011419012209 · Cited by 1,438
Solving Least Squares Problems
Bjork, A., Lawson, C. L., & Hanson, R. J. (1976) · Mathematics of Computation · doi:10.2307/2005340 · Cited by 1,146
Bennett, J. R., & Lanning, S. (2007) · Cited by 1,134
Data Analysis Using Stein's Estimator and its Generalizations
Efron, B., & Morris, C. (1975) · Journal of the American Statistical Association · doi:10.1080/01621459.1975.10479864 · Cited by 841
Modeling relationships at multiple scales to improve accuracy of large recommender systems
Bell, R., Koren, Y., & Volinsky, C. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281206 · Cited by 368
Self-citationBennett, J., Elkan, C., Liu, B., Smyth, P., & Tikk, D. (2007) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1345448.1345459 · Cited by 362
29. Data Analysis Using Stein's Estimator and Its Generalizations
Efron, B., & Morris, C. N. (2005) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718386.ch29 · Cited by 37
Cited by
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-citationFactorization 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-citationCollaborative 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-citationPolis, G. A., Anderson, W. B., & Holt, R. D. (1997) · Annual Review of Ecology and Systematics · doi:10.1146/annurev.ecolsys.28.1.289 · Cited by 2,362
Graph Neural Networks in Recommender Systems: A Survey
Wu, S., Sun, F., Zhang, W., Xie, X., & Cui, B. (2023) · ACM Computing Surveys · doi:10.1145/3535101 · Cited by 1,326
Metadata
- Authors
- Bell, R. M., & Koren, Y.
- Venue
- Seventh IEEE International Conference on Data Mining (ICDM 2007)
- Publisher
- IEEE
- Published
- 2007-10
- Pages
- 43-52
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W2172249709
- Cited by
- 499
- References
- 19
- FWCI
- 21.57
- 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.