TY - GEN
T1 - Self-supervised multi-channel hypergraph convolutional network for social recommendation
AU - Yu, Junliang
AU - Yin, Hongzhi
AU - Li, Jundong
AU - Wang, Qinyong
AU - Hung, Nguyen Quoc Viet
AU - Zhang, Xiangliang
N1 - KAUST Repository Item: Exported on 2021-06-29
Acknowledgements: This work was supported by ARC Discovery Project (Grant No.DP190101985 and DP170103954). Jundong Li is supported by National Science Foundation (NSF) under grant No. 2006844.
PY - 2021/4/19
Y1 - 2021/4/19
N2 - Social relations are often used to improve recommendation quality when user-item interaction data is sparse in recommender systems. Most existing social recommendation models exploit pairwise relations to mine potential user preferences. However, real-life interactions among users are very complex and user relations can be high-order. Hypergraph provides a natural way to model high-order relations, while its potentials for improving social recommendation are under-explored. In this paper, we fill this gap and propose a multi-channel hypergraph convolutional network to enhance social recommendation by leveraging high-order user relations. Technically, each channel in the network encodes a hypergraph that depicts a common high-order user relation pattern via hypergraph convolution. By aggregating the embeddings learned through multiple channels, we obtain comprehensive user representations to generate recommendation results. However, the aggregation operation might also obscure the inherent characteristics of different types of high-order connectivity information. To compensate for the aggregating loss, we innovatively integrate self-supervised learning into the training of the hypergraph convolutional network to regain the connectivity information with hierarchical mutual information maximization. Extensive experiments on multiple real-world datasets demonstrate the superiority of the proposed model over the current SOTA methods, and the ablation study verifies the effectiveness and rationale of the multi-channel setting and the self-supervised task. The implementation of our model is available via https://github.com/Coder-Yu/RecQ.
AB - Social relations are often used to improve recommendation quality when user-item interaction data is sparse in recommender systems. Most existing social recommendation models exploit pairwise relations to mine potential user preferences. However, real-life interactions among users are very complex and user relations can be high-order. Hypergraph provides a natural way to model high-order relations, while its potentials for improving social recommendation are under-explored. In this paper, we fill this gap and propose a multi-channel hypergraph convolutional network to enhance social recommendation by leveraging high-order user relations. Technically, each channel in the network encodes a hypergraph that depicts a common high-order user relation pattern via hypergraph convolution. By aggregating the embeddings learned through multiple channels, we obtain comprehensive user representations to generate recommendation results. However, the aggregation operation might also obscure the inherent characteristics of different types of high-order connectivity information. To compensate for the aggregating loss, we innovatively integrate self-supervised learning into the training of the hypergraph convolutional network to regain the connectivity information with hierarchical mutual information maximization. Extensive experiments on multiple real-world datasets demonstrate the superiority of the proposed model over the current SOTA methods, and the ablation study verifies the effectiveness and rationale of the multi-channel setting and the self-supervised task. The implementation of our model is available via https://github.com/Coder-Yu/RecQ.
UR - http://hdl.handle.net/10754/669805
UR - https://dl.acm.org/doi/10.1145/3442381.3449844
UR - http://www.scopus.com/inward/record.url?scp=85107940920&partnerID=8YFLogxK
U2 - 10.1145/3442381.3449844
DO - 10.1145/3442381.3449844
M3 - Conference contribution
SN - 9781450383127
SP - 413
EP - 424
BT - Proceedings of the Web Conference 2021
PB - ACM
ER -