SStaGCN: Simplified stacking based graph convolutional networks

Abstract

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.

References in corpus (11)

• The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
• Geometric deep learning: going beyond Euclidean data
• Discrete Signal Processing on Graphs
• Simplifying Graph Convolutional Networks
• Recurrent Models of Visual Attention
• On the Properties of the Softmax Function with Application in Game Theory and Reinforcement Learning
• DeepGCNs: Can GCNs Go as Deep as CNNs?
• Graph Wavelet Neural Network
• Max-Margin Nonparametric Latent Feature Models for Link Prediction
• Boost then Convolve: Gradient Boosting Meets Graph Neural Networks
• Generalization bounds for graph convolutional neural networks via Rademacher complexity