The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Recommender systems with social regularization
Abstract
Although Recommender Systems have been comprehensively analyzed in the past decade, the study of social-based recommender systems just started. In this paper, aiming at providing a general method for improving recommender systems by incorporating social network information, we propose a matrix factorization framework with social regularization. The contributions of this paper are four-fold: (1) We elaborate how social network information can benefit recommender systems; (2) We interpret the differences between social-based recommender systems and trust-aware recommender systems; (3) We coin the term Social Regularization to represent the social constraints on recommender systems, and we systematically illustrate how to design a matrix factorization objective function with social regularization; and (4) The proposed method is quite general, which can be easily extended to incorporate other contextual information, like social tags, etc. The empirical analysis on two large datasets demonstrates that our approaches outperform other state-of-the-art methods.
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
Geometric Deep Learning: Going beyond Euclidean data
Bronstein, M. M., Bruna, J., LeCun, Y., Szlam, A., & Vandergheynst, P. (2017) · IEEE Signal Processing Magazine · doi:10.1109/msp.2017.2693418 · Cited by 3,661
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
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., Zhou, D., Liu, C., Lyu, M. R., & King, I.
- Venue
- Proceedings of the fourth ACM international conference on Web search and data mining
- Publisher
- ACM
- Published
- 2011-02-09
- Pages
- 287-296
- OpenAlex
- W2144487656
- Cited by
- 1,626
- References
- 1
- FWCI
- 59.85
- 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: Recommender systems with social regularization. https://app.cochat.ai/papers/10.1145/1935826.1935877
- The paper
- Ma, H., Zhou, D., Liu, C., Lyu, M. R., & King, I. (2011). Recommender systems with social regularization. Proceedings of the fourth ACM international conference on Web search and data mining. https://doi.org/10.1145/1935826.1935877
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.