Our new X account is live! Follow @wizwand_team for updates
WorkDL logo mark

Heterogeneous Graph Contrastive Learning for Recommendation

About

Graph Neural Networks (GNNs) have become powerful tools in modeling graph-structured data in recommender systems. However, real-life recommendation scenarios usually involve heterogeneous relationships (e.g., social-aware user influence, knowledge-aware item dependency) which contains fruitful information to enhance the user preference learning. In this paper, we study the problem of heterogeneous graph-enhanced relational learning for recommendation. Recently, contrastive self-supervised learning has become successful in recommendation. In light of this, we propose a Heterogeneous Graph Contrastive Learning (HGCL), which is able to incorporate heterogeneous relational semantics into the user-item interaction modeling with contrastive learning-enhanced knowledge transfer across different views. However, the influence of heterogeneous side information on interactions may vary by users and items. To move this idea forward, we enhance our heterogeneous graph contrastive learning with meta networks to allow the personalized knowledge transformer with adaptive contrastive augmentation. The experimental results on three real-world datasets demonstrate the superiority of HGCL over state-of-the-art recommendation methods. Through ablation study, key components in HGCL method are validated to benefit the recommendation performance improvement. The source code of the model implementation is available at the link https://github.com/HKUDS/HGCL.

Mengru Chen, Chao Huang, Lianghao Xia, Wei Wei, Yong Xu, Ronghua Luo• 2023

Related benchmarks

TaskDatasetResultRank
Node ClassificationIMDB (test)
Macro F1 Score44.61
70
Node ClassificationDBLP (test)
Macro-F160.71
70
Node ClusteringDBLP (test)
NMI15.34
17
Node ClusteringACM (test)
NMI50.67
8
Semi-supervised node classificationACM
Training Time per Epoch (ms)8.79e+3
5
Semi-supervised node classificationIMDB
Training Time (ms)1.68e+4
5
Semi-supervised node classificationDBLP
Training Time (ms)4.08e+4
5
Showing 7 of 7 rows

Other info

Follow for update