Node classification based on Attribute Fuse Edge Features and Label Adaptive Adjustment

Most of existing graph representation learning methods only extract information from nodes and ignore the hidden information of edges. Nodes carry weak structural information thus affecting the specificity of node embeddings.To solve these problems, this paper proposes a node classification algorithm based on Attribute Fuse Edge Features and Label Adaptive Adjustment (AFEF_LAA).Firstly, Intimate-Relationship-Attribute of node is designed based on edge embeddings.Rz-Cos rule is constructed to perform the similarity metric between nodes and their neighbors to select intimate neighbor nodes.After that Reverse-TransE is constructed to encode embedding vectors of the edges connected to intimate neighborhood nodes.Secondly, a multi-fusion method based on smoothed neighborhood information is constructed.Each node in the original graph is smoothed together with its neighbor nodes.The smoothed original graph is multi-fused with multiple twin graphs. Finally, a strategy of label adaptive adjustment is proposed to select the label embedding vectors for input to the next-generation trainer by comparing accuracy.This strategy can improve the quality of graph embeddings while effectively avoiding the overfitting problem when processing high-dimensional data.AFEF_LAA is compared with the state-of-the-art algorithms on six graph datasets.Experimental results show that AFEF_LAA can achieve higher node classification accuracy.