Revisiting Graph Based Collaborative Filtering: A Linear Residual Graph Convolutional Network Approach

Citations Over TimeTop 1% of 2020 papers

Abstract

Graph Convolutional Networks~(GCNs) are state-of-the-art graph based representation learning models by iteratively stacking multiple layers of convolution aggregation operations and non-linear activation operations. Recently, in Collaborative Filtering~(CF) based Recommender Systems~(RS), by treating the user-item interaction behavior as a bipartite graph, some researchers model higher-layer collaborative signals with GCNs. These GCN based recommender models show superior performance compared to traditional works. However, these models suffer from training difficulty with non-linear activations for large user-item graphs. Besides, most GCN based models could not model deeper layers due to the over smoothing effect with the graph convolution operation. In this paper, we revisit GCN based CF models from two aspects. First, we empirically show that removing non-linearities would enhance recommendation performance, which is consistent with the theories in simple graph convolutional networks. Second, we propose a residual network structure that is specifically designed for CF with user-item interaction modeling, which alleviates the over smoothing problem in graph convolution aggregation operation with sparse user-item interaction data. The proposed model is a linear model and it is easy to train, scale to large datasets, and yield better efficiency and effectiveness on two real datasets. We publish the source code at https://github.com/newlei/LR-GCCF.

Related Papers

• → A Bipartite Graph-Based Recommender for Crowdfunding with Sparse Data(2020)2 cited
• → Graph-Aware Collaborative Filtering for Top-N Recommendation(2021)5 cited
• → A Model Hybrid Recommendation Approach Based on Knowledge Graph Convolution Networks(2021)2 cited
• → Collaborative Filtering with Graph-based Implicit Feedback(2018)