The Journal of China Universities of Posts and Telecommunications ›› 2024, Vol. 31 ›› Issue (3): 1-14.doi: 10.19682/j.cnki.1005-8885.2024.1004

    Next Articles

Graph convolutional network combined with random walks and graph attention network for node classification

Chen Yong, Xie Xiaozhu, Weng Wei   

  1. 1. College of Computer and Information Engineering, Xiamen University of Technology, Xiamen 361024, China
    2. Fujian Key Laboratory of Pattern Recognition and Image Understanding, Xiamen University of Technology, Xiamen 361024, China
  • Received:2022-12-27 Revised:2023-06-29 Online:2024-06-30 Published:2024-06-30
  • Contact: Xiao-Zhu XIE E-mail:xz4xxz@gmail.com
  • Supported by:
    the Natural Science Foundation of Xiamen (3502Z20227067).

Abstract: Graph conjoint attention (CAT) network is one of the best graph convolutional networks (GCNs) frameworks,
which uses a weighting mechanism to identify important neighbor nodes. However, this weighting mechanism is
learned based on static information, which means it is susceptible to noisy nodes and edges, resulting in significant
limitations. In this paper, a method is proposed to obtain context dynamically based on random walk, which allows
the context-based weighting mechanism to better avoid noise interference. Furthermore, the proposed context-based
weighting mechanism is combined with the node content-based weighting mechanism of the graph attention (GAT)
network to form a model based on a mixed weighting mechanism. The model is named as the context-based and
content-based graph convolutional network (CCGCN). CCGCN can better discover important neighbors, eliminate
noise edges, and learn node embedding by message passing. Experiments show that CCGCN achieves state-of-the-
art performance on node classification tasks in multiple datasets.

Key words: graph neural network (GNN), graph convolutional network (GCN), semi-supervised classification, graph analysis