Item Graph Convolution Collaborative Filtering for Inductive Recommendations
Not on the map. Why?
Abstract (arXiv)
Graph Convolutional Networks (GCN) have been recently employed as core component in the construction of recommender system algorithms, interpreting user-item interactions as the edges of a bipartite graph. However, in the absence of side information, the majority of existing models adopt an approach of randomly initialising the user embeddings and optimising them throughout the training process. This strategy makes these algorithms inherently transductive, curtailing their ability to generate predictions for users that were unseen at training time. To address this issue, we propose a convolution-based algorithm, which is inductive from the user perspective, while at the same time, depending only on implicit user-item interaction data. We propose the construction of an item-item graph through a weighted projection of the bipartite interaction network and to employ convolution to inject higher order associations into item embeddings, while constructing user representations as weighted sums of the items with which they have interacted. Despite not training individual embeddings for each user our approach achieves state of-the-art recommendation performance with respect to transductive baselines on four real-world datasets, showing at the same time robust inductive performance.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 18 of its 33 references that are in the map. First posted on arXiv 28 Mar 2023.
Builds on
18 of 33 references.
References · 18
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2019Simplifying Graph Convolutional Networkscited by 1,470
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
- 2018Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learningcited by 1,099
- 2018Representation Learning on Graphs with Jumping Knowledge Networkscited by 875
- 2015Image-based Recommendations on Styles and Substitutescited by 702
- 2019DropEdge: Towards Deep Graph Convolutional Networks on Node Classificationcited by 679
- 2019Neural Graph Collaborative Filteringcited by 660
- 2018FastGCN: Fast Learning with Graph Convolutional Networks via Importance Samplingcited by 583
- 2016Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filteringcited by 517
- 2018Graph Convolutional Networks for Text Classificationcited by 345
6 more
- 2018Zero-shot Recognition via Semantic Embeddings and Knowledge Graphscited by 155
- 2020Revisiting Graph based Collaborative Filtering: A Linear Residual Graph Convolutional Network Approachcited by 119
- 2019Inductive Matrix Completion Based on Graph Neural Networkscited by 85
- 2015Modeling User Exposure in Recommendationcited by 69
- 2018Deep Models of Interactions Across Setscited by 68
- 2013Provable Inductive Matrix Completioncited by 31
Built on by
Citing papers per year: 2024: 2.
2 papers.