The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Unifying user-based and item-based collaborative filtering approaches by similarity fusion
Abstract
Memory-based methods for collaborative filtering predict new ratings by averaging (weighted) ratings between, respectively, pairs of similar users or items. In practice, a large number of ratings from similar users or similar items are not available, due to the sparsity inherent to rating data. Consequently, prediction quality can be poor. This paper re-formulates the memory-based collaborative filtering problem in a generative probabilistic framework, treating individual user-item ratings as predictors of missing ratings. The final rating is estimated by fusing predictions from three sources: predictions based on ratings of the same item by other users, predictions based on different item ratings made by the same user, and, third, ratings predicted based on data from other but similar users rating other but similar items. Existing user-based and item-based approaches correspond to the two simple cases of our framework. The complete model is however more robust to data sparsity, because the different types of ratings are used in concert, while additional ratings from similar users towards similar items are employed as a background model to smooth the predictions. Experiments demonstrate that the proposed methods are indeed more robust against data sparsity and give better recommendations.
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 · cited 2×
“Examples of memory-based collaborative filtering include user-based methods [1, 5, 9, 14] and item-based meth-ods [ , 15].”
MethodAmazon.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
Kittler, J., Hatef, M., Duin, R. P. W., & Matas, J. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.667881 · Cited by 5,290
GroupLens: an open architecture for collaborative filtering of netnews
Resnick, P., Iacovou, N., Suchak, M., Bergstrom, P., & Riedl, J. (1994) · Proceedings of the 1994 ACM conference on Computer supported cooperative work - CSCW '94 · doi:10.1145/192844.192905 · Cited by 5,058
Empirical Analysis of Predictive Algorithms for Collaborative Filtering
Breese, J. S., Heckerman, D. E., & Kadie, C. M. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.7363 · Cited by 4,772
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
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
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
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
Latent semantic models for collaborative filtering
Hofmann, T. (2004) · ACM Transactions on Information Systems · doi:10.1145/963770.963774 · Cited by 1,378
Fast maximum margin matrix factorization for collaborative prediction
Rennie, J. D. M., & Srebro, N. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102441 · Cited by 939
Scalable collaborative filtering using cluster-based smoothing
Xue, G.-R., Lin, C., Yang, Q., Xi, W., Zeng, H.-J., Yu, Y., & Chen, Z. (2005) · Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1076034.1076056 · Cited by 658
Huang, Z., Chen, H., & Zeng, D. (2004) · ACM Transactions on Information Systems · doi:10.1145/963770.963775 · Cited by 644
Collaborative filtering with privacy via factor analysis
Canny, J. (2002) · Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/564376.564419 · Cited by 508
Collaborative Filtering by Personality Diagnosis: A Hybrid Memory- and Model-Based Approach
Pennock, D. M., Horvitz, E., Lawrence, S., & Giles, C. L. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.3885 · Cited by 499
A User-Item Relevance Model for Log-Based Collaborative Filtering
Wang, J., de Vries, A. P., & Reinders, M. J. T. (2006) · Lecture notes in computer science · doi:10.1007/11735106_5 · Cited by 88
Self-citationTerm-specific smoothing for the language modeling approach to information retrieval
Hiemstra, D. (2002) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/564376.564385 · Cited by 85
Cited by
LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation
He, X., Deng, K., Wang, X., Li, Y., Zhang, Y., & Wang, M. (2020) · Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3397271.3401063 · Cited by 4,430
Bobadilla, J., Ortega, F., Hernando, A., & Gutiérrez, A. (2013) · Knowledge-Based Systems · doi:10.1016/j.knosys.2013.03.012 · Cited by 3,158
Polis, 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
Recommender systems with social regularization
Ma, H., Zhou, D., Liu, C., Lyu, M. R., & King, I. (2011) · Proceedings of the fourth ACM international conference on Web search and data mining · doi:10.1145/1935826.1935877 · Cited by 1,626
SoRec: social recommendation using probabilistic matrix factorization
Ma, H., Yang, H., Lyu, M. R., & King, I. (2008) · Proceedings of the 17th ACM conference on Information and knowledge management · doi:10.1145/1458082.1458205 · Cited by 1,401
Metadata
- Authors
- Wang, J., de Vries, A. P., & Reinders, M. J. T.
- Venue
- Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
- Publisher
- ACM
- Published
- 2006-08-06
- Pages
- 501-508
- OpenAlex
- W2117311203
- Cited by
- 847
- References
- 18
- FWCI
- 27.19
- 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.