Deep multi-granularity graph embedding for user identity linkage across social networks
作者:
Highlights:
•
摘要
There have been increasing interests in user identity linkage (UIL) across social networks since it supports many applications such as cross-net recommendation, link prediction, and network fusion. Existing graph embedding based techniques cannot sufficiently model the higher-order structural properties in UIL. Moreover, the very limited supervisory anchor pairs (SAP), which are crucial for the task of UIL across social networks, are not utilized effectively. In this paper, a novel framework named multi-granularity graph embedding (MGGE) is proposed. And as an extension, a deep multi-granularity graph embedding model (DeepMGGE) is further developed. DeepMGGE uses the random walk (RW) to capture the higher-order structural proximities which is ignored by IONE Liu et al. (2016). Besides, DeepMGGE employs a heuristic edge-weighting mechanism given by deep learning to better capture the non-linear SAP-oriented structural properties. Experiments on real social networks demonstrate that the DeepMGGE outperforms state-of-the-art methods.
论文关键词:Granular computing,Graph embedding,Social network analysis,User identity linkage
论文评审过程:Received 18 August 2019, Revised 27 October 2019, Accepted 28 November 2019, Available online 16 December 2019, Version of Record 7 March 2020.
论文官网地址:https://doi.org/10.1016/j.knosys.2019.105301