The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
On top-k recommendation using social networks
Abstract
Recommendation accuracy can be improved by incorporating trust relationships derived from social networks. Most recent work on social network based recommendation is focused on minimizing the root mean square error (RMSE). Social network based top-k recommendation, which recommends to a user a small number of items at a time, is not well studied. In this paper, we conduct a comprehensive study on improving the accuracy of top-k recommendation using social networks. We first show that the existing social-trust enhanced Matrix Factorization (MF) models can be tailored for top-k recommendation by including observed and missing ratings in their training objective functions. We also propose a Nearest Neighbor (NN) based top-k recommendation method that combines users' neighborhoods in the trust network with their neighborhoods in the latent feature space. Experimental results on two publicly available datasets show that social networks can significantly improve the top-k hit ratio, especially for cold start users. Surprisingly, we also found that the technical approach for combining feedback data (e.g. ratings) with social network information that works best for minimizing RMSE works poorly for maximizing the hit ratio, and vice versa.
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
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
Cited by
Robust Anomaly Detection for Multivariate Time Series through Stochastic Recurrent Neural Network
Su, Y., Zhao, Y., Niu, C., Liu, R., Sun, W., & Pei, D. (2019) · Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3292500.3330672 · Cited by 1,804
A survey of collaborative filtering based social recommender systems
Yang, X., Guo, Y., Liu, Y., & Steck, H. (2014) · Computer Communications · doi:10.1016/j.comcom.2013.06.009 · Cited by 475
Self-citationRecommender systems based on user reviews: the state of the art
Chen, L., Chen, G., & Wang, F. (2015) · User Modeling and User-Adapted Interaction · doi:10.1007/s11257-015-9155-5 · Cited by 403
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
Can user privacy and recommendation performance be preserved simultaneously?
Feng, T., Guo, Y., & Chen, Y. (2015) · Computer Communications · doi:10.1016/j.comcom.2015.06.013 · Cited by 9
Self-citation
Metadata
- Authors
- Yang, X., Steck, H., Guo, Y., & Liu, Y.
- Venue
- Proceedings of the sixth ACM conference on Recommender systems
- Publisher
- ACM
- Published
- 2012-09-09
- Pages
- 67-74
- OpenAlex
- W2072422262
- Cited by
- 162
- References
- 1
- FWCI
- 11.88
- 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: On top-k recommendation using social networks. https://app.cochat.ai/papers/10.1145/2365952.2365969
- The paper
- Yang, X., Steck, H., Guo, Y., & Liu, Y. (2012). On top-k recommendation using social networks. Proceedings of the sixth ACM conference on Recommender systems. https://doi.org/10.1145/2365952.2365969
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.