Shen Yinghan, Jiang Xuhui, Li Zijian, Wang Yuanzhuo, Jin Xiaolong, Ma Shengjie, Cheng Xueqi
Data Intelligence System Research Center, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China.
University of Chinese Academy of Sciences, Beijing, China.
Knowl Inf Syst. 2022;64(10):2771-2795. doi: 10.1007/s10115-022-01724-2. Epub 2022 Aug 23.
Real-world network data consisting of social interactions can be incomplete due to deliberately erased or unsuccessful data collection, which cause the misleading of social interaction analysis for many various time-aware applications. Naturally, the link prediction task has drawn much research interest to predict the missing edges in the incomplete social network. However, existing studies of link prediction cannot effectively capture the entangling topological and temporal dynamics already residing in the social network, thus cannot effectively reasoning the missing interactions in dynamic networks. In this paper, we propose the NEAWalk, a novel model to infer the missing social interaction based on topological-temporal features of patterns in the social group. NEAWalk samples the query-relevant walks containing both the historical and evolving information by focusing on the temporal constraint and designs a dual-view anonymization procedure for extracting both topological and temporal features from the collected walks to conduct the inference. Two-track experiments on several well-known network datasets demonstrate that the NEAWalk stably achieves superior performance against several state-of-the-art baseline methods.
由社交互动组成的现实世界网络数据可能会因故意删除或数据收集不成功而不完整,这会导致许多不同的时间感知应用对社交互动分析产生误导。自然而然地,链接预测任务引发了众多研究兴趣,旨在预测不完整社交网络中的缺失边。然而,现有的链接预测研究无法有效捕捉社交网络中已然存在的复杂拓扑和时间动态,因此无法有效推理动态网络中的缺失互动。在本文中,我们提出了NEAWalk,这是一种基于社交群体中模式的拓扑 - 时间特征来推断缺失社交互动的新型模型。NEAWalk通过关注时间约束对包含历史和演化信息的查询相关路径进行采样,并设计了一种双视图匿名化程序,用于从收集的路径中提取拓扑和时间特征以进行推理。在几个知名网络数据集上进行的双轨实验表明,与几种最先进的基线方法相比,NEAWalk稳定地实现了卓越的性能。