mlsanityData to 14 Oct 2026

A Node-collaboration-informed Graph Convolutional Network for Precise Representation to Undirected Weighted Graphs

arXiv 2211.16689 ↗First posted 30 Nov 2022cs.LG cs.SIcited by 1

Not on the map. Why?

Abstract (arXiv)

An undirected weighted graph (UWG) is frequently adopted to describe the interactions among a solo set of nodes from real applications, such as the user contact frequency from a social network services system. A graph convolutional network (GCN) is widely adopted to perform representation learning to a UWG for subsequent pattern analysis tasks such as clustering or missing data estimation. However, existing GCNs mostly neglects the latent collaborative information hidden in its connected node pairs. To address this issue, this study proposes to model the node collaborations via a symmetric latent factor analysis model, and then regards it as a node-collaboration module for supplementing the collaboration loss in a GCN. Based on this idea, a Node-collaboration-informed Graph Convolutional Network (NGCN) is proposed with three-fold ideas: a) Learning latent collaborative information from the interaction of node pairs via a node-collaboration module; b) Building the residual connection and weighted representation propagation to obtain high representation capacity; and c) Implementing the model optimization in an end-to-end fashion to achieve precise representation to the target UWG. Empirical studies on UWGs emerging from real applications demonstrate that owing to its efficient incorporation of node-collaborations, the proposed NGCN significantly outperforms state-of-the-art GCNs in addressing the task of missing weight estimation. Meanwhile, its good scalability ensures its compatibility with more advanced GCN extensions, which will be further investigated in our future studies.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 13 of its 69 references that are in the map. First posted on arXiv 30 Nov 2022.

Builds on

13 of 69 references.

References · 13

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,139
  3. 2017Neural Collaborative Filteringcited by 1,111
  4. 2018Link Prediction Based on Graph Neural Networkscited by 832
  5. 2020Geom-GCN: Geometric Graph Convolutional Networkscited by 826
  6. 2019MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixingcited by 443
  7. 2020Structural Deep Clustering Networkcited by 145
  8. 2020When Does Self-Supervision Help Graph Convolutional Networks?cited by 121
  9. 2020Revisiting Graph based Collaborative Filtering: A Linear Residual Graph Convolutional Network Approachcited by 120
  10. 2021SLAPS: Self-Supervision Improves Structure Learning for Graph Neural Networkscited by 110
  11. 2022Neo-GNNs: Neighborhood Overlap-aware Graph Neural Networks for Link Predictioncited by 78
  12. 2019Efficient Neural Interaction Function Search for Collaborative Filteringcited by 16
1 more
  1. 2020Enhancing Social Recommendation with Adversarial Graph Convolutional Networkscited by 16

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.