AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
Article Link
Collect
Submit Manuscript
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Regular Paper

Incremental User Identification Across Social Networks Based on User-Guider Similarity Index

School of Computer Science and Engineering, Northeastern University, Shenyang 110004, China
School of Information, Liaoning University, Shenyang 110036, China
Show Author Information

Abstract

Identifying accounts across different online social networks that belong to the same user has attracted extensive attentions. However, existing techniques rely on given user seeds and ignore the dynamic changes of online social networks, which fails to generate high quality identification results. In order to solve this problem, we propose an incremental user identification method based on user-guider similarity index (called CURIOUS), which efficiently identifies users and well captures the changes of user features over time. Specifically, we first construct a novel user-guider similarity index (called USI) to speed up the matching between users. Second we propose a two-phase user identification strategy consisting of USI-based bidirectional user matching and seed-based user matching, which is effective even for incomplete networks. Finally, we propose incremental maintenance for both USI and the identification results, which dynamically captures the instant states of social networks. We conduct experimental studies based on three real-world social networks. The experiments demonstrate the effectiveness and the efficiency of our proposed method in comparison with traditional methods. Compared with the traditional methods, our method improves precision, recall and rank score by an average of 0.19, 0.16 and 0.09 respectively, and reduces the time cost by an average of 81%.

Electronic Supplementary Material

Download File(s)
jcst-37-5-1086-Highlights.pdf (142.6 KB)

References

[1]
Mu X, Zhu F, Lim E, Xiao J, Wang J, Zhou Z. User identity linkage by latent user space modelling. In Proc. the22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Aug. 2016, pp. 1775-1784.DOI: 10.1145/2939672.2939849.
[2]
Kemp S. Global overview report. Technical Report, Hootsuite, 2022. https://datareportal.com/reports/digital-2022-global-overview-report, Jan. 2022.
[3]
Liu J, Zhang F, Song X, Song Y, Lin C, Hon H. What's in a name? An unsupervised approach to link users across communities. In Proc. the 6th ACM International Conference on Web Search and Data Mining, Feb. 2013, pp. 495-504, DOI: 10.1145/2433396.2433457.
[4]
Zhang J, Kong X, Yu P S. Transferring heterogeneous links across location-based social networks. In Proc. the 7th ACM International Conference on Web Search and Data Mining, Feb. 2014, pp. 303-312, DOI: 10.1145/2556195.2559894.
[5]

Li Y, Peng Y, Zhang Z, Yin H, Xu Q. Matching user accounts across social networks based on username and display name. World Wide Web, 2019, 22(3): 1075-1097. DOI: 10.1007/s11280-018-0571-4.

[6]
Liu J, Chai G, Luo Y, Feng J, Tang N. Feature augmentation with reinforcement learning. In Proc. the 38th IEEE International Conference on Data Engineering, May 2022, pp. 3360-3372. DOI: 10.1109/ICDE53745.2022.00317.
[7]
Backstrom L, Leskovec J. Supervised random walks: Predicting and recommending links in social networks. In Proc. the 4th International Conference on Web Search and Web Data Mining, Feb. 2011, pp. 635-644, DOI: 10.1145/1935826.1935914.
[8]
Zafarani R, Liu H. Connecting users across social media sites: A behavioral-modeling approach. In Proc. the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Aug. 2013, pp. 41-49. DOI: 10.1145/2487575.2487648.
[9]
Shao J, Wang Y, Gao H, Shen H, Li Y, Cheng X. Locate who you are: Matching geo-location to text for user identity linkage. In Proc. the 30th ACM International Conference on Information and Knowledge Management, Nov. 2021, pp. 3413-3417. DOI: 10.1145/3459637.3482134.
[10]

Feng J, Li Y, Yang Z, Zhang M, Wang H, Cao H, Jin D. User identity linkage via co-attentive neural network from heterogeneous mobility data. IEEE Trans. Knowl. Data Eng., 2022, 34(2): 954-968. DOI: 10.1109/TKDE.2020.2989732.

[11]
Nilizadeh S, Kapadia A, Ahn Y. Community-enhanced de-anonymization of online social networks. In Proc. the 21st ACM SIGSAC Conference on Computer and Communications Security, Nov. 2014, pp. 537-548. DOI: 10.1145/2660267.2660324.
[12]

Zhou X, Liang X, Zhang H, Ma Y. Cross-platform identification of anonymous identical users in multiple social media networks. IEEE Trans. Knowl. Data Eng., 2016, 28(2): 411-424. DOI: 10.1109/TKDE.2015.2485222.

[13]

Singh R, Xu J, Berger B. Global alignment of multiple protein interaction networks with application to functional orthology detection. Natl. Acad. Sci. USA, 2008, 105(35): 12763-12768. DOI: 10.1073/pnas.0806627105.

[14]

Bayati M, Gleich D, Saberi A, Wang Y. Message-passing algorithms for sparse network alignment. ACM Trans. Knowl. Discov. Data, 2013, 7(1): Article No. 3. DOI: 10.1145/2435209.2435212.

[15]
Nassar H, Gleich D. Multimodal network alignment. In Proc. the 17th SIAM International Conference on Data Mining, Apr. 2017, pp. 615-623. DOI: 10.1137/1.9781611974973.69.
[16]
Nassar H, Veldt N, Mohammadi S, Grama A, Gleich D. Low rank spectral network alignment. In Proc. the 27th International World Wide Web Conference, Apr. 2018, pp. 619-628. DOI: 10.1145/3178876.3186128.
[17]

Zhou X, Liang X, Du X, Zhao J. Structure based user identification across social networks. IEEE Trans. Knowl. Data Eng., 2018, 30(6): 1178-1191. DOI: 10.1109/TKDE.2017.2784430.

[18]
Mao X, Wang W, Wu Y, Lan M. Boosting the speed of entity alignment 10 X: Dual attention matching network with normalized hard sample mining. In Proc. the 30th International World Wide Web Conference, Apr. 2021, pp. 821-832. DOI: 10.1145/3442381.3449897.
[19]
Chen X, Song X, Peng G, Feng S, Nie L. Adversarial-enhanced hybrid graph network for user identity linkage. In Proc. the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, Jul. 2021, pp. 1084-1093. DOI: 10.1145/3404835.3462946.
[20]

Li X, Cao Y, Li Q, Shang Y, Li Y, Liu Y, Xu G. RLINK: Deep reinforcement learning for user identity linkage. World Wide Web, 2021, 24(1): 85-103. DOI: 10.1007/s11280-020-00833-8.

[21]
Chu X, Fan X, Yao D, Zhu Z, Huang J, Bi J. Cross-network embedding for multi-network alignment. In Proc. the 28th International World Wide Web Conference, May 2019, pp. 273-284. DOI: 10.1145/3308558.3313499.
[22]
Chen H, Yin H, Sun X, Chen T, Gabrys B, Musial K. Multi-level graph convolutional networks for cross-platform anchor link prediction. In Proc. the 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Aug. 2020, pp. 1503-1511. DOI: 10.1145/3394486.3403201.
[23]

Shun F, Wang G, Xia S, Liu L. Deep multi-granularity graph embedding for user identity linkage across social networks. Knowl. Based Syst., 2020, 193: Article No. 105301. DOI: 10.1016/j.knosys.2019.105301.

[24]
Yan J, Yang S, Hancock E. Learning for graph matching and related combinatorial optimization problems. In Proc. the 29th International Joint Conference on Artificial Intelligence, Jan. 2021, pp. 4988-4996. DOI: 10.24963/ijcai.2020/683.
[25]

Zhou F, Zhang K, Xie S, Luo X. Learning to correlate accounts across online social networks: An embedding-based approach. INFORMS J. Comput., 2020, 32(3): 714-729. DOI: 10.1287/ijoc.2019.0911.

[26]
Chu X, Fan X, Zhu Z, Bi J. Variational cross-network embedding for anonymized user identity linkage. In Proc. the 30th ACM International Conference on Information and Knowledge Management, Nov. 2021, pp. 2955-2959. DOI: 10.1145/3459637.3482214.
[27]
Qian J, Li X, Zhang C, Chen L. De-anonymizing social networks and inferring private attributes using knowledge graphs. In Proc. the 35th Annual IEEE International Conference on Computer Communications, Apr. 2016. DOI: 10.1109/INFOCOM.2016.7524578.
[28]
Heimann M, Shen H, Safavi T, Koutra D. REGAL: Representation learning-based graph alignment. In Proc. the 27th ACM International Conference on Information and Knowledge Management, Oct. 2018, pp. 117-126. DOI: 10.1145/3269206.3271788.
[29]
Yasar A, Çatalyürek Ü. An iterative global structure-assisted labeled network aligner. In Proc. the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Aug. 2018, pp. 2614-2623. DOI: 10.1145/3219819.3220079.
[30]

Chen B, Chen X. MAUIL: Multilevel attribute embedding for semisupervised user identity linkage. Inf. Sci., 2022, 593: 527-545. DOI: 10.1016/j.ins.2022.02.023.

[31]
Fang Z, Cao Y, Liu Y, Tan J, Guo L, Shang Y. A co-training method for identifying the same person across social networks. In Proc. the 5th IEEE Global Conference on Signal and Information Processing, Nov. 2017, pp. 1412-1416. DOI: 10.1109/GlobalSIP.2017.8309194.
[32]
Zhong Z, Cao Y, Guo M, Nie Z. CoLink: An unsupervised framework for user identity linkage. In Proc. the 32nd AAAI Conference on Artificial Intelligence, Feb. 2018, pp. 5714-5721. DOI: 10.1609/aaai.v32i1.12014.
[33]
Xie Z, Zhu R, Zhao K, Liu J, Zhou G, Huang J. A contextual alignment enhanced cross graph attention network for cross-lingual entity alignment. In Proc. the 28th International Conference on Computational Linguistics, Dec. 2020, pp. 5918-5928. DOI: 10.18653/v1/2020.coling-main.520.
[34]
Xiang Y, Zhang Z, Chen J, Chen X, Lin Z, Zheng Y. OntoEA: Ontology-guided entity alignment via joint knowledge graph embedding. In Proc. the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, Aug. 2021, pp. 1117-1128. DOI: 10.18653/v1/2021.findings-acl.96.
[35]
Heimann M, Lee W, Pan S, Chen K, Koutra D. HashAlign: Hash-based alignment of multiple graphs. In Proc. the 22nd Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, Jun. 2018, pp. 726-739. DOI: 10.1007/978-3-319-93040-4_57.
[36]
Agarwal P, Fox K, Munagala K, Nath A. Parallel algorithms for constructing range and nearest-neighbor searching data structures. In Proc. the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, June 26-July 1, 2016, pp. 429-440. DOI: 10.1145/2902251.2902303.
[37]

Brown R. Building a balanced k-d tree in O(kn log n) time. Journal of Computer Graphics Techniques, 2015, 4(1): 50-68.

[38]
Yianilos P. Data structures and algorithms for nearest neighbor search in general metric spaces. In Proc. the 4th Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, Jan. 1993, pp. 311-321.
[39]
Narayanan A, Shmatikov V. De-anonymizing social networks. In Proc. the 30th IEEE Symposium on Security and Privacy, May 2009, pp. 173-187. DOI: 10.1109/SP.2009.22.
[40]
Zhang S, Tong H. FINAL: Fast attributed network alignment. In Proc. the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Aug. 2016, pp. 1345-1354. DOI: 10.1145/2939672.2939766.
Journal of Computer Science and Technology
Pages 1086-1104
Cite this article:
Kou Y, Li D, Shen D-R, et al. Incremental User Identification Across Social Networks Based on User-Guider Similarity Index. Journal of Computer Science and Technology, 2022, 37(5): 1086-1104. https://doi.org/10.1007/s11390-022-2430-0

458

Views

0

Crossref

0

Web of Science

0

Scopus

0

CSCD

Altmetrics

Received: 15 April 2022
Accepted: 15 September 2022
Published: 30 September 2022
©Institute of Computing Technology, Chinese Academy of Sciences 2022
Return