Graph node classification algorithm based on similarity random walk aggregation

Aiming at the relatively low accuracy of methods such as MLP and GCN in heterogeneous graph node classification tasks, this paper proposes a graph neural network based on similarity random walk aggregation (SRW-GNN). Most existing node classification methods usually take neighbor nodes as neighborhoods, but the target node and its neighbors in heterogeneous graphs usually belong to different categories. To reduce the impact of heterogeneity on node embedding, SRW-GNN uses the similarity between nodes as probability to perform random walks and takes the sampled paths as neighborhoods to obtain more homogeneous information. The order in which nodes appear in the path is particularly critical for capturing neighborhood information. However, most existing GNN aggregators are insensitive to node order. This paper introduces a path aggregator based on recurrent neural network (RNN) to simultaneously extract the features and order information of nodes in the path. In addition, nodes have different preferences for different paths. In order to adaptively learn the importance of different paths in node encoding, an attention mechanism is used to dynamically adjust the contribution of each path to the final embedding. Experimental results on multiple commonly used heterogeneous graph datasets show that the accuracy of this method is significantly better than that of MLP, GCN, H2GCN, HOG-GCN and other methods, verifying its effectiveness in heterogeneous graph node classification tasks.