mlsanityData to 7 Oct 2026

Collaboration-Aware Graph Convolutional Network for Recommender Systems

arXiv 2207.06221 ↗First posted 3 Jul 2022cs.IR cs.LGcited by 12

Not on the map. Why?

Abstract (arXiv)

Graph Neural Networks (GNNs) have been successfully adopted in recommender systems by virtue of the message-passing that implicitly captures collaborative effect. Nevertheless, most of the existing message-passing mechanisms for recommendation are directly inherited from GNNs without scrutinizing whether the captured collaborative effect would benefit the prediction of user preferences. In this paper, we first analyze how message-passing captures the collaborative effect and propose a recommendation-oriented topological metric, Common Interacted Ratio (CIR), which measures the level of interaction between a specific neighbor of a node with the rest of its neighbors. After demonstrating the benefits of leveraging collaborations from neighbors with higher CIR, we propose a recommendation-tailored GNN, Collaboration-Aware Graph Convolutional Network (CAGCN), that goes beyond 1-Weisfeiler-Lehman(1-WL) test in distinguishing non-bipartite-subgraph-isomorphic graphs. Experiments on six benchmark datasets show that the best CAGCN variant outperforms the most representative GNN-based recommendation model, LightGCN, by nearly 10% in Recall@20 and also achieves around 80% speedup. Our code is publicly available at https://github.com/YuWVandy/CAGCN.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 29 of its 64 references that are in the map. First posted on arXiv 3 Jul 2022.

Builds on

29 of 64 references.

References · 29

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2018How Powerful are Graph Neural Networks?cited by 4,355
  3. 2016node2vec: Scalable Feature Learning for Networkscited by 1,913
  4. 2014DeepWalk: Online Learning of Social Representationscited by 1,543
  5. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
  6. 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,133
  7. 2017Neural Collaborative Filteringcited by 1,108
  8. 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 987
  9. 2018Link Prediction Based on Graph Neural Networkscited by 829
  10. 2019Neural Graph Collaborative Filteringcited by 660
  11. 2020Social-STGCNN: A Social Spatio-Temporal Graph Convolutional Neural Network for Human Trajectory Predictioncited by 324
  12. 2020Self-supervised Graph Learning for Recommendationcited by 305
17 more
  1. 2020Towards Deeper Graph Neural Networkscited by 296
  2. 2015A Review of Relational Machine Learning for Knowledge Graphscited by 264
  3. 2021From Stars to Subgraphs: Uplifting Any GNN with Local Structure Awarenesscited by 154
  4. 2015VBPR: Visual Bayesian Personalized Ranking from Implicit Feedbackcited by 151
  5. 2021UltraGCN: Ultra Simplification of Graph Convolutional Networks for Recommendationcited by 87
  6. 2021Learning from Counterfactual Links for Link Predictioncited by 69
  7. 2020Streaming Graph Neural Networks via Continual Learningcited by 63
  8. 2022Improving Fairness in Graph Neural Networks via Mitigating Sensitive Attribute Leakagecited by 61
  9. 2021Graph Trend Filtering Networks for Recommendationscited by 53
  10. 2017Latent Relational Metric Learning via Memory-based Attention for Collaborative Rankingcited by 38
  11. 2021Neural Link Prediction with Walk Poolingcited by 36
  12. 2021Tree Decomposed Graph Neural Networkcited by 35
  13. 2020Lifelong Graph Learningcited by 31
  14. 2018Collaborative Memory Network for Recommendation Systemscited by 30
  15. 2017BiRank: Towards Ranking on Bipartite Graphscited by 15
  16. 2022ChemicalX: A Deep Learning Library for Drug Pair Scoringcited by 11
  17. 2022Revisiting Neighborhood-based Link Prediction for Collaborative Filteringcited by 11

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 3; 2024: 5; 2025: 3; 2026: 1.

12 papers.