Semisupervised Classification with High-Order Graph Learning Attention Neural Network. (7th December 2021)

• Record Type: Journal Article
• Authors: Yang, Wu-Lue; Chen, Xiao-Ze; Yang, Xu-Hua
• Other Names: Hemanth Jude Academic Editor.
• Is Part Of: Mathematical problems in engineering. Volume 2021(2021)
• Publication Date: 2021-12-07
• Subjects: Engineering mathematics -- Periodicals; 510.2462
• DOI: 10.1155/2021/3911137
• Languages: English
• ISSNs: 1024-123X

Abstract

Abstract : At present, the graph neural network has achieved good results in the semisupervised classification of graph structure data. However, the classification effect is greatly limited in those data without graph structure, incomplete graph structure, or noise. It has no high prediction accuracy and cannot solve the problem of the missing graph structure. Therefore, in this paper, we propose a high-order graph learning attention neural network (HGLAT) for semisupervised classification. First, a graph learning module based on the improved variational graph autoencoder is proposed, which can learn and optimize graph structures for data sets without topological graph structure and data sets with missing topological structure and perform regular constraints on the generated graph structure to make the optimized graph structure more reasonable. Then, in view of the shortcomings of graph attention neural network (GAT) that cannot make full use of the graph high-order topology structure for node classification and graph structure learning, we propose a graph classification module that extends the attention mechanism to high-order neighbors, in which attention decays according to the increase of neighbor order. HGLAT performs joint optimization on the two modules of graph learning and graph classification and performs semisupervised node classification while optimizing the graph structure, which improves the classification performance. On 5 real data sets, by comparing 8 classification methods, the experiment shows that HGLAT has achieved good classification results on both a data set with graph structure and a data set without graph structure.