Hierarchical Structure-Feature Aware Graph Neural Network for Node Classification

Abstract

In recent years, graph neural network is used to process graph data and has been successfully applied to graph node classification task. Due to the complexity of graph structure and the difficulty of obtaining node labels, node classification in datasets with fewer labels becomes a challenge. Existing node classification problems with few-label nodes datasets usually use neighbor aggregation schemes. However, these methods lack the “graph pooling mechanism,” which makes these models impossible to make full use of the global graph information. To solve the problem, we propose a Hierarchical Structure-Feature aware Graph Neural Network (HSFGNN) model. The model learns node features by a hierarchical mechanism that repeatedly utilizes coarsening and refining methods at different levels. Firstly, we use topological information, node characteristics and connectivity of the graph to construct an intuitive and effective coarsening part based on multivariable analysis technology. Secondly, we aggregate the unselected nodes’ features into the top-k nodes, so that the coarser nodes contain more abundant valid graph information. Finally, we propose an additional attention mechanism to obtain more accurate final representations of nodes. Experimental results show that the HSFGNN model achieves outstanding classification accuracy on the dataset with less labeled data.