Graph Convolutional Matrix Completion

Abstract

We consider matrix completion for recommender systems from the point of view of link prediction on graphs. Interaction data such as movie ratings can be represented by a bipartite user-item graph with labeled edges denoting observed ratings. Building on recent progress in deep learning on graph-structured data, we propose a graph auto-encoder framework based on differentiable message passing on the bipartite interaction graph. Our model shows competitive performance on standard collaborative filtering benchmarks. In settings where complimentary feature information or structured data such as a social network is available, our framework outperforms recent state-of-the-art methods.

9 pages, 3 figures, updated with additional experimental evaluation

References in corpus (3)

• Semi-Supervised Classification with Graph Convolutional Networks
• Variational Graph Auto-Encoders
• Matrix Completion on Graphs

Cited by in corpus (12)

• KGAT: Knowledge Graph Attention Network for Recommendation
• Use of Deep Learning in Modern Recommendation System: A Summary of Recent Works
• Compositional Fairness Constraints for Graph Embeddings
• STAR-GCN: Stacked and Reconstructed Graph Convolutional Networks for Recommender Systems
• Binarized Collaborative Filtering with Distilling Graph Convolutional Networks
• Graph Learning Network: A Structure Learning Algorithm
• Coherent Comment Generation for Chinese Articles with a Graph-to-Sequence Model
• Regional based query in graph active learning
• Graph DNA: Deep Neighborhood Aware Graph Encoding for Collaborative Filtering
• Inferring Javascript types using Graph Neural Networks
• Deep Social Collaborative Filtering
• Spectrum-enhanced Pairwise Learning to Rank