随机游动
嵌入
节点(物理)
计算机科学
相似性(几何)
代表(政治)
数据挖掘
理论计算机科学
可视化
人工智能
数学
图像(数学)
结构工程
政治
统计
工程类
法学
政治学
作者
Hegui Zhang,Gang Kou,Yi Peng,Boyu Zhang
标识
DOI:10.1016/j.ins.2023.119765
摘要
Network embedding is a fundamental part of many network analysis tasks, including node classification and link prediction. The existing random walk-based embedding methods aim to learn node embedding that preserves information on either node proximity or structural similarity. However, the information on both role and community is important to network nodes. To address the shortcomings of the existing methods, this paper proposes a novel method for network embedding called the RARE, which can be used for the analysis of different types of networks and even disconnected networks. The proposed method uses the role and community information of nodes to preserve both node proximity and structural similarity in the learned node embeddings. The walks generated through the role-aware random walk can capture the role and community information of nodes. The obtained walks are input to the Skip-gram model to learn the final embedding of nodes. In addition, the RARE is extended to the CRARE that adds the sampling of high-order community members to the customized random walk so that the node’s representation can preserve more structural information of the network. The performances of the proposed methods are evaluated on multi-class node classification, link prediction, and network visualization tasks. Experimental results on different domain datasets indicate that the proposed methods outperform the baseline methods. The proposed methods can be further accelerated using parallelization in the random walk generation process.
科研通智能强力驱动
Strongly Powered by AbleSci AI