Node Similarity Preserving Graph Convolutional Networks

Abstract

Graph Neural Networks (GNNs) have achieved tremendous success in various real-world applications due to their strong ability in graph representation learning. GNNs explore the graph structure and node features by aggregating and transforming information within node neighborhoods. However, through theoretical and empirical analysis, we reveal that the aggregation process of GNNs tends to destroy node similarity in the original feature space. There are many scenarios where node similarity plays a crucial role. Thus, it has motivated the proposed framework SimP-GCN that can effectively and efficiently preserve node similarity while exploiting graph structure. Specifically, to balance information from graph structure and node features, we propose a feature similarity preserving aggregation which adaptively integrates graph structure and node features. Furthermore, we employ self-supervised learning to explicitly capture the complex feature similarity and dissimilarity relations between nodes. We validate the effectiveness of SimP-GCN on seven benchmark datasets including three assortative and four disassorative graphs. The results demonstrate that SimP-GCN outperforms representative baselines. Further probe shows various advantages of the proposed framework. The implementation of SimP-GCN is available at \url{https://github.com/ChandlerBang/SimP-GCN}.

WSDM 2021

References in corpus (22)

• Semi-Supervised Classification with Graph Convolutional Networks
• Assortative mixing in networks
• The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
• Inductive Representation Learning on Large Graphs
• Neural Message Passing for Quantum Chemistry
• Spectral Networks and Locally Connected Networks on Graphs
• Graph Neural Networks: A Review of Methods and Applications
• Adversarial Attacks on Neural Networks for Graph Data
• Representation Learning on Graphs with Jumping Knowledge Networks
• Variational Graph Auto-Encoders
• DropEdge: Towards Deep Graph Convolutional Networks on Node Classification
• Towards Deeper Graph Neural Networks
• Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learning
• Contrastive Multi-View Representation Learning on Graphs
• Adversarial Attacks on Graph Neural Networks via Meta Learning
• Self-supervised Learning on Graphs: Deep Insights and New Direction
• Adversarial Examples on Graph Data: Deep Insights into Attack and Defense
• DeepRobust: A PyTorch Library for Adversarial Attacks and Defenses
• When Does Self-Supervision Help Graph Convolutional Networks?
• Revisiting Over-smoothing in Deep GCNs
• Adversarial Attacks and Defenses on Graphs: A Review, A Tool and Empirical Studies
• Regional Homogeneity: Towards Learning Transferable Universal Adversarial Perturbations Against Defenses