SStaGCN: Simplified stacking based graph convolutional networks
Not on the map. Why?
Abstract (arXiv)
Graph convolutional network (GCN) is a powerful model studied broadly in various graph structural data learning tasks. However, to mitigate the over-smoothing phenomenon, and deal with heterogeneous graph structural data, the design of GCN model remains a crucial issue to be investigated. In this paper, we propose a novel GCN called SStaGCN (Simplified stacking based GCN) by utilizing the ideas of stacking and aggregation, which is an adaptive general framework for tackling heterogeneous graph data. Specifically, we first use the base models of stacking to extract the node features of a graph. Subsequently, aggregation methods such as mean, attention and voting techniques are employed to further enhance the ability of node features extraction. Thereafter, the node features are considered as inputs and fed into vanilla GCN model. Furthermore, theoretical generalization bound analysis of the proposed model is explicitly given. Extensive experiments on 3 public citation networks and another 3 heterogeneous tabular data demonstrate the effectiveness and efficiency of the proposed approach over state-of-the-art GCNs. Notably, the proposed SStaGCN can efficiently mitigate the over-smoothing problem of GCN.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 31 of its 49 references that are in the map. First posted on arXiv 16 Nov 2021.
Builds on
31 of 49 references.
References · 31
- 2017Attention Is All You Needcited by 60,361
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2014Neural Machine Translation by Jointly Learning to Align and Translatecited by 4,548
- 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,089
- 2019Simplifying Graph Convolutional Networkscited by 1,477
- 2013Spectral Networks and Locally Connected Networks on Graphscited by 1,102
- 2018Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learningcited by 1,102
- 2016Geometric deep learning: going beyond Euclidean datacited by 1,048
- 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 993
19 more
- 2020Simple and Deep Graph Convolutional Networkscited by 860
- 2019Heterogeneous Graph Attention Networkcited by 734
- 2019DropEdge: Towards Deep Graph Convolutional Networks on Node Classificationcited by 680
- 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 595
- 2019DeepGCNs: Can GCNs Go as Deep as CNNs?cited by 527
- 2014Recurrent Models of Visual Attentioncited by 349
- 2018Graph Convolutional Networks for Text Classificationcited by 345
- 2020Graph Random Neural Network for Semi-Supervised Learning on Graphscited by 213
- 2016A vector-contraction inequality for Rademacher complexitiescited by 142
- 2017On the Properties of the Softmax Function with Application in Game Theory and Reinforcement Learningcited by 142
- 2019Graph Wavelet Neural Networkcited by 131
- 2019Spatially-Aware Graph Neural Networks for Relational Behavior Forecasting from Sensor Datacited by 104
- 2019Break the Ceiling: Stronger Multi-scale Deep Graph Convolutional Networkscited by 62
- 2021Boost then Convolve: Gradient Boosting Meets Graph Neural Networkscited by 44
- 2019AdaGCN: Adaboosting Graph Convolutional Networks into Deep Modelscited by 37
- 2015ABCNN: Attention-Based Convolutional Neural Network for Modeling Sentence Pairscited by 35
- 2019Fast Haar Transforms for Graph Neural Networkscited by 20
- 2021Evaluating Deep Graph Neural Networkscited by 19
- 2021Generalization bounds for graph convolutional neural networks via Rademacher complexitycited by 17
Built on by
Not cited yet.