• Corpus ID: 241033199

GRCN: Graph-Refined Convolutional Network for Multimedia Recommendation with Implicit Feedback

  title={GRCN: Graph-Refined Convolutional Network for Multimedia Recommendation with Implicit Feedback},
  author={Wei Yinwei and Wang Xiang and Nie Liqiang and He Xiangnan and Chua Tat-Seng},
Reorganizing implicit feedback of users as a user-item interaction graph facilitates the applications of graph convolutional networks (GCNs) in recommendation tasks. In the interaction graph, edges between user and item nodes function as the main element of GCNs to perform information propagation and generate informative representations. Nevertheless, an underlying challenge lies in the quality of interaction graph, since observed interactions with lessinterested items occur in implicit… 

Figures and Tables from this paper



MGAT: Multimodal Graph Attention Network for Recommendation

KGAT: Knowledge Graph Attention Network for Recommendation

This work proposes a new method named Knowledge Graph Attention Network (KGAT), which explicitly models the high-order connectivities in KG in an end-to-end fashion and significantly outperforms state-of-the-art methods like Neural FM and RippleNet.

Neural Graph Collaborative Filtering

This work develops a new recommendation framework Neural Graph Collaborative Filtering (NGCF), which exploits the user-item graph structure by propagating embeddings on it, effectively injecting the collaborative signal into the embedding process in an explicit manner.

MMGCN: Multi-modal Graph Convolution Network for Personalized Recommendation of Micro-video

A Multi-modal Graph Convolution Network (MMGCN) framework built upon the message-passing idea of graph neural networks, which can yield modal-specific representations of users and micro-videos to better capture user preferences is designed.

Graph Convolutional Neural Networks for Web-Scale Recommender Systems

A novel method based on highly efficient random walks to structure the convolutions and a novel training strategy that relies on harder-and-harder training examples to improve robustness and convergence of the model are developed.

Graph Convolutional Matrix Completion

A graph auto-encoder framework based on differentiable message passing on the bipartite interaction graph that shows competitive performance on standard collaborative filtering benchmarks and outperforms recent state-of-the-art methods.

HOP-rec: high-order proximity for implicit recommendation

This paper presents HOP-Rec, a unified and efficient method that incorporates factorization and graph-based models and significantly outperforms the state of the art on a range of large-scale real-world datasets.

VBPR: Visual Bayesian Personalized Ranking from Implicit Feedback

This paper proposes a scalable factorization model to incorporate visual signals into predictors of people's opinions, which is applied to a selection of large, real-world datasets and makes use of visual features extracted from product images using (pre-trained) deep networks.

Routing Micro-videos via A Temporal Graph-guided Recommendation System

This work designs a novel graph-based sequential network to simultaneously model users' dynamic and diverse interest and introduces users' multi-level interest into the recommendation model via a user matrix that is able to learn the enhanced representation of users' interest.

Reinforced Negative Sampling over Knowledge Graph for Recommendation

This work develops a new negative sampling model, Knowledge Graph Policy Network (KGPolicy), which works as a reinforcement learning agent to explore high-quality negatives and achieves significant improvements over both state-of-the-art sampling methods, and KG-enhanced recommender models like KGAT.