Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 162

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

Yang, Xiwang, Steck, Harald, Guo, Yang, Liu, Yong · 2012 · Proceedings of the sixth ACM conference on Recommender systems

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/2365952.2365969

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 1 references

Cited by

See all 162

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.