Journal
PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE 2021 (WWW 2021)
Volume -, Issue -, Pages 1296-1305Publisher
ASSOC COMPUTING MACHINERY
DOI: 10.1145/3442381.3449986
Keywords
Recommendation; Graph Convolution Networks; Message-Passing Strategy; Interest-aware; Subgraph
Categories
Funding
- National Natural Science Foundation of China [61902223, U1936203]
- Innovation Teams in Colleges and Universities in Jinan [:2018GXRC014]
- Shandong Provincial Natural Science Foundation [ZR2019JQ23]
- Young creative team in universities of Shandong Province [2020KJN012]
Ask authors/readers for more resources
We propose a novel Interest-aware Message-Passing GCN (IMP-GCN) recommendation model, which tackles the over-smoothing problem in recommendation by performing high-order graph convolution inside subgraphs. By designing an unsupervised subgraph generation module, we are able to effectively identify users with common interests and avoid propagating negative information. Experimental results demonstrate that our model achieves performance improvement by stacking more layers.
Graph Convolution Networks (GCNs) manifest great potential in recommendation. This is attributed to their capability on learning good user and item embeddings by exploiting the collaborative signals from the high-order neighbors. Like other GCN models, the GCN based recommendation models also suffer from the notorious over-smoothing problem - when stacking more layers, node embeddings become more similar and eventually indistinguishable, resulted in performance degradation. The recently proposed LightGCN and LR-GCN alleviate this problem to some extent, however, we argue that they overlook an important factor for the over-smoothing problem in recommendation, that is, high-order neighboring users with no common interests of a user can be also involved in the user's embedding learning in the graph convolution operation. As a result, the multi-layer graph convolution will make users with dissimilar interests have similar embeddings. In this paper, we propose a novel Interest-aware Message-Passing GCN (IMP-GCN) recommendation model, which performs high-order graph convolution inside subgraphs. The subgraph consists of users with similar interests and their interacted items. To form the subgraphs, we design an unsupervised subgraph generation module, which can effectively identify users with common interests by exploiting both user feature and graph structure. To this end, our model can avoid propagating negative information from high-order neighbors into embedding learning. Experimental results on three large-scale benchmark datasets show that our model can gain performance improvement by stacking more layers and outperform the state-of-the-art GCN-based recommendation models significantly.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available