Multi-channel Graph Convolutional Networks Enhanced by Label Propagation Algorithm
Most graph convolutional networks(GCN)improve the experimental performance of node classification tasks by desig-ning efficient methods for information propagation and preservation,while ignoring the propagation of node label information in the topological and attribute spaces.Aiming at the above problems,the paper proposes a multi-channel graph convolution model MGCN-LPA enhanced by the label propagation algorithm(LPA).The model enhances the propagation of node features and label information by increasing the weights of relationship between nodes of the same class in the attribute space and topology space.Firstly,it calculates the similarity values of different node attributes and generates an attribute relation graph using thek-nearest neighbor algorithm.Then,it combines the GCN and LPA in the graph convolution layer GCN-LPA to extract potential features from the attribute graph and attribute relation graph,generating topological node representations and attribute node representa-tions.Finally,the method combines the topological and attribute representations and utilizes the final representation for node clas-sification tasks.On three benchmark graph datasets,the experimental performance of MGCN-LPA can match the current state-of-the-art baseline models.The classification results on the Cora and Citeseer datasets show improvements of 9.3％and 12％re-spectively compared to the best-performing baseline.The experimental results demonstrate that MGCN-LPA can increase the weights of paths between nodes of the same class and enhance the propagation of information among nodes of the same class,thereby enhancing the performance of node classification tasks.In addition,the ablation experiments demonstrate that the fusion of both topological space and attribute space information in MGCN-LPA enhances the model's representational capacity and ge-neralization compared to variants using only one type of information.This fusion allows for the full extraction and preservation of latent features present in the original graph.
万方数据
维普
