Neighbor Interaction Aware Graph Convolution Networks for Recommendation
Jianing Sun, Yingxue Zhang, Wei Guo, Huifeng Guo, Ruiming Tang, Xiuqiang He, Chen Ma, Mark Coates
Abstract
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 preference for an item based on the similarity of the representations. In many settings, there is abundant relationship information, including user-item interaction history, user-user and item-item similarities. In an attempt to exploit these relationships to learn better embeddings, researchers have turned to the emerging field of Graph Convolutional Neural Networks (GCNs), and applied GCNs for recommendation. Although these prior works have demonstrated promising performance, directly apply GCNs to process the user-item bipartite graph is suboptimal because the GCNs do not consider the intrinsic differences between user nodes and item nodes. Additionally, existing large-scale graph neural networks use aggregation functions such as sum/mean/max pooling operations to generate a node embedding that considers the nodes' neighborhood (i.e., the adjacent nodes in the graph), and these simple aggregation strategies fail to preserve the relational information in the neighborhood. To resolve the above limitations, in this paper, we propose a novel framework NIA-GCN, which can explicitly model the relational information between neighbor nodes and exploit the heterogeneous nature of the user-item bipartite graph. We conduct empirical studies on four public benchmarks, demonstrating a significant improvement over state-of-the-art approaches. Furthermore, we generalize our framework to a commercial App store recommendation scenario. We observe significant improvement on a large-scale commercial dataset, demonstrating the practical potential for our proposed solution as a key component of a large scale commercial recommender system. Furthermore, online experiments are conducted to demonstrate that NIA-GCN outperforms the baseline by 10.19% and 9.95% in average in terms of CTR and CVR during ten-day AB test in a mainstream App store.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 0f43a78c-417d-45b8-a450-dfcefb592a70Cited by top-tier papers16
- LGMRec: Local and Global Graph Learning for Multimodal RecommendationZhiqiang Guo, Jianjun Li, Guohui Li, Chaoyang Wang et al.AAAI 2024 · 164 citations
- HGCF: Hyperbolic Graph Convolution Networks for Collaborative FilteringJianing Sun, Zhaoyue Cheng, Saba Zuberi, Felipe Pérez et al.WWW 2021 · 159 citations
- FlexGraph: a flexible and efficient distributed framework for GNN trainingLei Wang, Qiang Yin, Chao Tian, Jianbang Yang et al.EuroSys 2021 · 66 citations
- Personalized Graph Signal Processing for Collaborative FilteringJiahao Liu, Dongsheng Li, Hansu Gu, Tun Lu et al.WWW 2023 · 50 citations
- ApeGNN: Node-Wise Adaptive Aggregation in GNNs for RecommendationDan Zhang, Yifan Zhu, Yuxiao Dong, Yuandong Wang et al.WWW 2023 · 43 citations
Related papers
- IACLR: Intention Alignment via Contrastive Learning for Bipartite Graph RecommendationHuiying Hu, Tuo Wang, Yixiao Zhou, Xiaoqing LyuWWW 2026
- Candidate-aware Graph Contrastive Learning for RecommendationWei He, Guohao Sun, Jinhu Lu, Xiu Susie FangSIGIR 2023 · 64 citations
- Intent Distribution based Bipartite Graph Representation LearningHaojie Li, Wei Wei, Guanfeng Liu, Jinhuan Liu et al.SIGIR 2024 · 4 citations
- Graph Heterogeneous Multi-Relational RecommendationChong Chen, Weizhi Ma, Min Zhang, Zhaowei Wang et al.AAAI 2021 · 199 citations
- Layer-refined Graph Convolutional Networks for RecommendationXin Zhou, Donghui Lin, Yong Liu, Chunyan MiaoICDE 2023 · 81 citations
