CoChat

Dual Channel Hypergraph Collaborative Filtering

Ji, Shuyi, Feng, Yifan, Ji, Rongrong, Zhao, Xibin, Tang, Wanwan, Gao, Yue · 2020 · Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining
Cited by 224

The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.

Abstract

Collaborative filtering (CF) is one of the most popular and important recommendation methodologies in the heart of numerous recommender systems today. Although widely adopted, existing CF-based methods, ranging from matrix factorization to the emerging graph-based methods, suffer inferior performance especially when the data for training are very limited. In this paper, we first pinpoint the root causes of such deficiency and observe two main disadvantages that stem from the inherent designs of existing CF-based methods, i.e., 1) inflexible modeling of users and items and 2) insufficient modeling of high-order correlations among the subjects. Under such circumstances, we propose a dual channel hypergraph collaborative filtering (DHCF) framework to tackle the above issues. First, a dual channel learning strategy, which holistically leverages the divide-and-conquer strategy, is introduced to learn the representation of users and items so that these two types of data can be elegantly interconnected while still maintaining their specific properties. Second, the hypergraph structure is employed for modeling users and items with explicit hybrid high-order correlations. The jump hypergraph convolution (JHConv) method is proposed to support the explicit and efficient embedding propagation of high-order correlations. Comprehensive experiments on two public benchmarks and two new real-world datasets demonstrate that DHCF can achieve significant and consistent improvements against other state-of-the-art methods.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1145/3394486.3403253

Cites

20 of 20 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.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

  • Matrix Factorization Techniques for Recommender Systems

    Koren, Y., Bell, R., & Volinsky, C. (2009) · Computer · doi:10.1109/mc.2009.263 · Cited by 11,673 · cited 2×

    “The third kind of CF methods, including matrix factorization (MF) [14] and graph-based methods [2, 25], have made efforts to indiscriminately integrate the users and the items together for recommendation.”
    Method
  • 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 1×

    “Similarly, the item-based methods, as the second kind of methods [20], only employ the item-item correlations for recommendation.”
    Method
  • Neural Collaborative Filtering

    He, X., Liao, L., Zhang, H., Nie, L., Hu, X., & Chua, T.-S. (2017) · Proceedings of the 26th International Conference on World Wide Web · doi:10.1145/3038912.3052569 · Cited by 6,652 · cited 2×

    “In addition, considering the MF’s linear inner product cannot comprehensively reflect the intricate inter-relationships between users and items, several works have made efforts to investigate the non-linear interaction function [10] with the support of deep neural networks.”
    Background
  • The MovieLens Datasets: History and Context

    Harper, F. M., & Konstan, J. A. (2016) · ACM Transactions on Interactive Intelligent Systems · doi:10.1145/2827872 · Cited by 6,627 · cited 9×

    “Stacking multiple layers such as DHCF-3 in MovieLens-100K may introduce noise and further lead to overfitting.”
    MethodInfluential
  • BPR: Bayesian Personalized Ranking from Implicit Feedback

    Rendle, S., Freudenthaler, C., Gantner, Z., & Schmidt-Thieme, L. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1205.2618 · Cited by 4,242 · cited 10×

    “Further, Rendle et al. devised BPR [18] which uses pairwise log-sigmoid function to directly optimize the vanilla AUC based on Bayesian AUC optimization.”
    MethodInfluential
  • Factorization meets the neighborhood: a multifaceted collaborative filtering model

    Koren, Y. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401944 · Cited by 3,852 · cited 1×

    “There are several modelbased CF algorithms, including association algorithms [15], clustering approaches [23], Bayesian networks [27], and latent factor models like singular value decomposition (SVD) [13, 17].”
    Method
  • Neural Graph Collaborative Filtering

    Wang, X., He, X., Wang, M., Feng, F., & Chua, T.-S. (2019) · Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3331184.3331267 · Cited by 3,823 · cited 11×

    “• NGCF employs more complex node update strategy and has double learnable parameters compared with Pinsage.”
    BackgroundMethodInfluential
  • Graph Convolutional Neural Networks for Web-Scale Recommender Systems

    Ying, R., He, R., Chen, K., Eksombatchai, P., Hamilton, W. L., & Leskovec, J. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3219819.3219890 · Cited by 3,733 · cited 2×

    “PinSage [28] embeds the GCN to commercial recommender systems through adopting the idea of GraphSAGE [7], coupled with employing multiple GCN layers in pins-boards graph.”
    BackgroundMethod
  • SimRank: a measure of structural-context similarity

    Jeh, G., & Widom, J. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775126 · Cited by 1,925 · cited 1×

    “One typical prior work is SimRank [11], whose basic idea lies in that two objects referred by similar objects tend to be similar too.”
    Background
  • Hypergraph Neural Networks

    Feng, Y., You, H., Zhang, Z., Ji, R., & Gao, Y. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.33013558 · Cited by 1,895

    Self-citation

Show all 20 references

Cited by

Metadata

Authors
Ji, S., Feng, Y., Ji, R., Zhao, X., Tang, W., & Gao, Y.
Venue
Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining
Publisher
ACM
Published
2020-08-20
Pages
2020-2029
OpenAlex
W3080566854
Cited by
224
References
20
FWCI
17.86
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

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.