Semi-Supervised Classification of Graph Convolutional Networks with Laplacian Rank Constraints

摘要

Graph convolutional networks (GCNs), as an extension of classic convolutional neural networks (CNNs) in graph processing, have achieved good results in completing semi-supervised learning tasks. Traditional GCNs usually use fixed graph to complete various semi-supervised classification tasks, such as chemical molecules and social networks. Graph is an important basis for the classification of GCNs model, and its quality has a large impact on the performance of the model. For low-quality input graph, the classification results of the GCNs model are often not ideal. In order to improve the classification effect of GCNs model, we propose a graph learning method to generate high-quality topological graph, which is more suitable for GCNs model classification. We use the correlation between the data to generate a data similarity matrix, and apply Laplacian rank constraint to similarity matrix, so that the number of connected components of the topological graph is consistent with the number of categories of the original data. Experimental results on 10 real datasets show that our method is better than the comparison method in classification effect.