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

The DOI matches its Crossref record.

HOP-rec: high-order proximity for implicit recommendation

Yang, Jheng-Hong, Chen, Chih-Ming, Wang, Chuan-Ju, Tsai, Ming-Feng·2018·Proceedings of the 12th ACM Conference on Recommender Systems

Abstract

Recommender systems are vital ingredients for many e-commerce services. In the literature, two of the most popular approaches are based on factorization and graph-based models; the former approach captures user preferences by factorizing the observed direct interactions between users and items, and the latter extracts indirect preferences from the graphs constructed by user-item interactions. In this paper we present HOP-Rec, a unified and efficient method that incorporates the two approaches. The proposed method involves random surfing on a graph to harvest high-order information among neighborhood items for each user. Instead of factorizing a transition matrix, our method introduces a confidence weighting parameter to simulate all high-order information simultaneously, for which we maintain a sparse user-item interaction matrix and enrich the matrix for each user using random walks. Experimental results show that our approach significantly outperforms the state of the art on a range of large-scale real-world datasets.

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/3240323.3240381

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.

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

Cited by

See all 190

Metadata

Authors
Yang, J.-H., Chen, C.-M., Wang, C.-J., & Tsai, M.-F.
Venue
Proceedings of the 12th ACM Conference on Recommender Systems
Publisher
ACM
Published
2018-09-27
Pages
140-144
OpenAlex
W2894039884
Cited by
190
References
0
FWCI
16.94
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: HOP-rec: high-order proximity for implicit recommendation. https://app.cochat.ai/papers/10.1145/3240323.3240381
The paper
Yang, J.-H., Chen, C.-M., Wang, C.-J., & Tsai, M.-F. (2018). HOP-rec: high-order proximity for implicit recommendation. Proceedings of the 12th ACM Conference on Recommender Systems. https://doi.org/10.1145/3240323.3240381

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.