基于图编码网络的社交网络节点分类方法

Node classification method in social network based on graph encoder network

针对如何融合节点自身属性以及网络结构信息实现社交网络节点分类的问题,提出了一种基于图编码网络的社交网络节点分类算法。首先,每个节点向邻域节点传播其携带的信息;其次,每个节点通过神经网络挖掘其与邻域节点之间可能隐含的关系,并且将这些关系进行融合;最后,每个节点根据自身信息以及与邻域节点关系的信息提取更高层次的特征,作为节点的表示,并且根据该表示对节点进行分类。在微博数据集上,与经典的深度随机游走模型、逻辑回归算法有以及最近提出的图卷积网络算法相比,所提算法分类准确率均有大于8%的提升;在DBLP数据集上,与多层感知器相比分类准确率提升4.83%,与图卷积网络相比分类准确率提升0.91%。

Aiming at how to merge the nodes’ attributes and network structure information to realize the classification of social network nodes, a social network node classification algorithm based on graph encoder network was proposed. Firstly, the information of each node was propagated to its neighbors. Secondly, for each node, the possible implicit relationships between itself and its neighbor nodes were mined through neural network, and these relationships were merged together. Finally, the higher-level features of each node were extracted based on the information of the node itself and the relationships with the neighboring nodes and were used as the representation of the node, and the node was classified according to this representation. On the Weibo dataset, compared with DeepWalk model, logistic regression algorithm and the recently proposed graph convolutional network, the proposed algorithm has the classification accuracy greater than 8%;on the DBLP dataset, compared with multilayer perceptron, the classification accuracy of this algorithm is increased by 4.83%, and is increased by 0.91% compared with graph convolutional network.