arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2102.03302cs.SIcs.AI
收藏

基于高阶信息融合的自监督深度图嵌入社区发现

Self-Supervised Deep Graph Embedding with High-Order Information Fusion for Community Discovery

Dalian University of Technology(大连理工大学)

Shuliang Xu, Shenglan Liu, Lin Feng

摘要:

深度图嵌入是社区发现的一种重要方法。具有自监督机制的深度图神经网络可以从未标记和非结构化的图数据中获取节点的低维嵌入向量。图的高阶信息可以为节点的表示学习提供更丰富的结构信息。然而,由于图神经网络的层数有限,大多数自监督图神经网络只使用邻接矩阵作为图的输入拓扑信息,不能获得太高的阶信息。如果有太多的层,过度平滑的现象会出现。因此,如何利用浅层图神经网络获取并融合图的高阶信息是一个重要的问题。提出了一种基于自监督机制的深度图嵌入算法。该算法利用自监督机制和图的不同高阶信息训练多个深度图卷积神经网络。该方法将多个图卷积神经网络的输出进行融合,提取包含图的属性和结构信息的节点表示。此外,在训练过程中引入了数据增强和负采样,以提高嵌入效果。在五个实验数据集上对所提出的算法和比较算法进行了实验。实验结果表明,在大多数实验数据集上,该算法的性能优于对比算法。实验结果表明,该算法是一种有效的社区发现算法。

英文摘要:

Deep graph embedding is an important approach for community discovery. Deep graph neural network with self-supervised mechanism can obtain the low-dimensional embedding vectors of nodes from unlabeled and unstructured graph data. The high-order information of graph can provide more abundant structure information for the representation learning of nodes. However, most self-supervised graph neural networks only use adjacency matrix as the input topology information of graph and cannot obtain too high-order information since the number of layers of graph neural network is fairly limited. If there are too many layers, the phenomenon of over smoothing will appear. Therefore how to obtain and fuse high-order information of graph by a shallow graph neural network is an important problem. In this paper, a deep graph embedding algorithm with self-supervised mechanism for community discovery is proposed. The proposed algorithm uses self-supervised mechanism and different high-order information of graph to train multiple deep graph convolution neural networks. The outputs of multiple graph convolution neural networks are fused to extract the representations of nodes which include the attribute and structure information of a graph. In addition, data augmentation and negative sampling are introduced into the training process to facilitate the improvement of embedding result. The proposed algorithm and the comparison algorithms are conducted on the five experimental data sets. The experimental results show that the proposed algorithm outperforms the comparison algorithms on the most experimental data sets. The experimental results demonstrate that the proposed algorithm is an effective algorithm for community discovery.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑