Graph convolutional networks (GCNs) have been successfully applied in node classification tasks of network mining. However, most of models based on neighborhood aggregation are usually shallow and lack the "graph pooling" mechanism, which prevents the model from obtaining adequate global information. In order to increase the receptive field, we propose a novel deep Hierarchical Graph Convolutional Network (H-GCN) for semi-supervised node classification. H-GCN first repeatedly aggregates structurally similar nodes to hyper-nodes and then refines the coarsened graph to the original to restore the representation for each node. Instead of merely aggregating one- or two-hop neighborhood information, the proposed coarsening procedure enlarges the receptive field for each original node, hence more global information can be learned. Comprehensive experiments conducted on public datasets demonstrate effectiveness of the proposed method over the state-of-art methods. Notably, our model gains substantial improvements when only very few labeled samples are provided.

本研究提出了一种新的深层分层图卷积网络(H-GCN)，通过聚合结构相似的节点形成超节点，然后再将粗化的图细化到原始图以恢复每个节点的表达，从而扩大每个节点的感受野，能够获取更多的全局信息，并在各种公共基准测试图数据集上表现出强大的实证性能。

用于半监督节点分类的分层图卷积网络