UltraGCN: ultra simplification of graph convolutional networks for recommendation

K Mao, J Zhu, X Xiao, B Lu, Z Wang, X He - Proceedings of the 30th ACM …, 2021 - dl.acm.org
With the recent success of graph convolutional networks (GCNs), they have been widely
applied for recommendation, and achieved impressive performance gains. The core of …

SVD-GCN: A simplified graph convolution paradigm for recommendation

S Peng, K Sugiyama, T Mine - Proceedings of the 31st ACM international …, 2022 - dl.acm.org
With the tremendous success of Graph Convolutional Networks (GCNs), they have been
widely applied to recommender systems and have shown promising performance. However …

Lightgcn: Simplifying and powering graph convolution network for recommendation

X He, K Deng, X Wang, Y Li, Y Zhang… - Proceedings of the 43rd …, 2020 - dl.acm.org
Graph Convolution Network (GCN) has become new state-of-the-art for collaborative
filtering. Nevertheless, the reasons of its effectiveness for recommendation are not well …

Graph convolutional network for recommendation with low-pass collaborative filters

W Yu, Z Qin - International Conference on Machine Learning, 2020 - proceedings.mlr.press
Abstract\textbf {G} raph\textbf {C} onvolutional\textbf {N} etwork (\textbf {GCN}) is widely used
in graph data learning tasks such as recommendation. However, when facing a large graph …

Less is more: Reweighting important spectral graph features for recommendation

S Peng, K Sugiyama, T Mine - Proceedings of the 45th International ACM …, 2022 - dl.acm.org
As much as Graph Convolutional Networks (GCNs) have shown tremendous success in
recommender systems and collaborative filtering (CF), the mechanism of how they …

How powerful is graph convolution for recommendation?

Y Shen, Y Wu, Y Zhang, C Shan, J Zhang… - Proceedings of the 30th …, 2021 - dl.acm.org
Graph convolutional networks (GCNs) have recently enabled a popular class of algorithms
for collaborative filtering (CF). Nevertheless, the theoretical underpinnings of their empirical …

Intentgc: a scalable graph convolution framework fusing heterogeneous information for recommendation

J Zhao, Z Zhou, Z Guan, W Zhao, W Ning… - Proceedings of the 25th …, 2019 - dl.acm.org
The remarkable progress of network embedding has led to state-of-the-art algorithms in
recommendation. However, the sparsity of user-item interactions (ie, explicit preferences) on …

Neighbor interaction aware graph convolution networks for recommendation

J Sun, Y Zhang, W Guo, H Guo, R Tang, X He… - Proceedings of the 43rd …, 2020 - dl.acm.org
Personalized recommendation plays an important role in many online services. Substantial
research has been dedicated to learning embeddings of users and items to predict a user's …

Joint multi-grained popularity-aware graph convolution collaborative filtering for recommendation

K Liu, F Xue, X He, D Guo… - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
Graph convolution networks (GCNs), with their efficient ability to capture high-order
connectivity in graphs, have been widely applied in recommender systems. Stacking …

Structured graph convolutional networks with stochastic masks for recommender systems

H Chen, L Wang, Y Lin, CCM Yeh, F Wang… - Proceedings of the 44th …, 2021 - dl.acm.org
Graph Convolutional Networks (GCNs) are powerful for collaborative filtering. The key
component of GCNs is to explore neighborhood aggregation mechanisms to extract high …