The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
SoRec: social recommendation using probabilistic matrix factorization
Open accessAbstract
Data sparsity, scalability and prediction quality have been recognized as the three most crucial challenges that every collaborative filtering algorithm or recommender system confronts. Many existing approaches to recommender systems can neither handle very large datasets nor easily deal with users who have made very few ratings or even none at all. Moreover, traditional recommender systems assume that all the users are independent and identically distributed; this assumption ignores the social interactions or connections among users. In view of the exponential growth of information generated by online social networks, social network analysis is becoming important for many Web applications. Following the intuition that a person's social network will affect personal behaviors on the Web, this paper proposes a factor analysis approach based on probabilistic matrix factorization to solve the data sparsity and poor prediction accuracy problems by employing both users' social network information and rating records. The complexity analysis indicates that our approach can be applied to very large datasets since it scales linearly with the number of observations, while the experimental results shows that our method performs much better than the state-of-the-art approaches, especially in the circumstance that users have made few or no ratings.
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
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 by
Circle-based recommendation in online social networks
Yang, X., Steck, H., & Liu, Y. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339728 · Cited by 346
mTrust: discerning multi-faceted trust in a connected world
Tang, J., Gao, H., & Liu, H. (2012) · Proceedings of the fifth ACM international conference on Web search and data mining · doi:10.1145/2124295.2124309 · Cited by 337
A Deep Graph Neural Network-Based Mechanism for Social Recommendations
Guo, Z., & Wang, H. (2021) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2020.2986316 · Cited by 269
A Probabilistic Model for Using Social Networks in Personalized Item Recommendation
Chaney, A. J. B., Blei, D. M., & Eliassi-Rad, T. (2015) · Proceedings of the 9th ACM Conference on Recommender Systems · doi:10.1145/2792838.2800193 · Cited by 164
Learning Personalized Preference of Strong and Weak Ties for Social Recommendation
Wang, X., Hoi, S. C. H., Ester, M., Bu, J., & Chen, C. (2017) · Proceedings of the 26th International Conference on World Wide Web · doi:10.1145/3038912.3052556 · Cited by 97
Metadata
- Authors
- Ma, H., Yang, H., Lyu, M. R., & King, I.
- Venue
- Proceedings of the 17th ACM conference on Information and knowledge management
- Publisher
- ACM
- Published
- 2008-10-26
- Pages
- 931-940
- OpenAlex
- W2119825970
- Cited by
- 1,401
- References
- 1
- FWCI
- 13.38
- Type
- conference paper
- Language
- en
- Open access
- green
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: SoRec: social recommendation using probabilistic matrix factorization. https://app.cochat.ai/papers/10.1145/1458082.1458205
- The paper
- Ma, H., Yang, H., Lyu, M. R., & King, I. (2008). SoRec: social recommendation using probabilistic matrix factorization. Proceedings of the 17th ACM conference on Information and knowledge management. https://doi.org/10.1145/1458082.1458205
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.