Higher-Order Graph Convolutional Networks With Multi-Scale Neighborhood Pooling for Semi-Supervised Node Classification

Existing popular methods for semi-supervised node classification with high-order convolution improve the learning ability of graph convolutional networks (GCNs) by capturing the feature information from high-order neighborhoods. However, these methods with high-order convolution usually require many parameters and high computational complexity. To address these limitations, we propose HCNP, a new higher-order GCN for semi-supervised node learning tasks, which can simultaneously aggregate information of various neighborhoods by constructing high-order convolution. In HCNP, we reduce the number of parameters using a weight sharing mechanism and combine the neighborhood information via multi-scale neighborhood pooling. Further, HCNP does not require a large number of hidden units, and it fits a few parameters and exhibits low complexity. We show that HCNP matches GCNs in terms of complexity and parameters. Comprehensive evaluations on publication citation datasets (Citeseer, Pubmed, and Cora) demonstrate that the proposed methods outperform MixHop in most cases while maintaining lower complexity and fewer parameters and achieve state-of-the-art performance in terms of accuracy and parameters compared to other baselines.