Interest-aware Message-Passing GCN for Recommendation

by   Fan Liu, et al.

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.


page 1

page 2

page 3

page 4


RGCF: Refined Graph Convolution Collaborative Filtering with concise and expressive embedding

Graph Convolution Network (GCN) has attracted significant attention and ...

Quaternion-Based Graph Convolution Network for Recommendation

Graph Convolution Network (GCN) has been widely applied in recommender s...

Layer-refined Graph Convolutional Networks for Recommendation

Recommendation models utilizing Graph Convolutional Networks (GCNs) have...

AGNN: Alternating Graph-Regularized Neural Networks to Alleviate Over-Smoothing

Graph Convolutional Network (GCN) with the powerful capacity to explore ...

A^2-GCN: An Attribute-aware Attentive GCN Model for Recommendation

As important side information, attributes have been widely exploited in ...

UltraGCN: Ultra Simplification of Graph Convolutional Networks for Recommendation

With the recent success of graph convolutional networks (GCNs), they hav...

GCNSLIM: Graph Convolutional Network with Sparse Linear Methods for E-government Service Recommendation

Graph Convolutional Networks have made significant strides in Collabora-...

Please sign up or login with your details

Forgot password? Click here to reset