On the Power of Graph Neural Networks and Feature Augmentation Strategies to Classify Social Networks
Not on the map. Why?
Abstract (arXiv)
This paper studies four Graph Neural Network architectures (GNNs) for a graph classification task on a synthetic dataset created using classic generative models of Network Science. Since the synthetic networks do not contain (node or edge) features, five different augmentation strategies (artificial feature types) are applied to nodes. All combinations of the 4 GNNs (GCN with Hierarchical and Global aggregation, GIN and GATv2) and the 5 feature types (constant 1, noise, degree, normalized degree and ID -- a vector of the number of cycles of various lengths) are studied and their performances compared as a function of the hidden dimension of artificial neural networks used in the GNNs. The generalisation ability of these models is also analysed using a second synthetic network dataset (containing networks of different sizes).Our results point towards the balanced importance of the computational power of the GNN architecture and the the information level provided by the artificial features. GNN architectures with higher computational power, like GIN and GATv2, perform well for most augmentation strategies. On the other hand, artificial features with higher information content, like ID or degree, not only consistently outperform other augmentation strategies, but can also help GNN architectures with lower computational power to achieve good performance.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 12 of its 17 references that are in the map. First posted on arXiv 11 Jan 2024.
Builds on
12 of 17 references.
References · 12
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2021How Attentive are Graph Attention Networks?cited by 835
- 2015Convolutional Networks on Graphs for Learning Molecular Fingerprintscited by 754
- 2019Graph U-Netscited by 492
- 2019Self-Attention Graph Poolingcited by 421
- 2019A Fair Comparison of Graph Neural Networks for Graph Classificationcited by 244
- 2021Identity-aware Graph Neural Networkscited by 198
- 2019Graph Convolutional Networks with EigenPoolingcited by 94
- 2022AHP: Learning to Negative Sample for Hyperedge Predictioncited by 12
- 2019Benchmarks for Graph Embedding Evaluationcited by 1
Built on by
Not cited yet.