大连理工大学  登录  English 
张宪超
点赞:

教授   博士生导师   硕士生导师

主要任职: 科学技术研究院国防重大项目办公室主任

性别: 男

毕业院校: 中国科技大学

学位: 博士

所在单位: 软件学院、国际信息与软件学院

学科: 计算机应用技术. 软件工程

电子邮箱: xczhang@dlut.edu.cn

手机版

访问量:

开通时间: ..

最后更新时间: ..

当前位置: 中文主页 >> 科学研究 >> 论文成果
GCM: A Greedy-Based Cross-Matching Algorithm for Identifying Users Across Multiple Online Social Networks

点击次数:

论文类型: 会议论文

第一作者: Liang, Wenxin

合写作者: Meng, Bo,He, Xiaosong,Zhang, Xianchao

发表时间: 2015-05-19

收录刊物: EI、CPCI-S、Scopus

卷号: 9074

页面范围: 51-70

摘要: The User Identity Resolution (UIR) problem is concerned with recognizing the same person with multiple virtual profiles in different online social networks (OSNs). Most of the existing methods focus only on the similarity of profile attributes or simply combine the profile attributes and linkages of friends. In this paper, we propose a novel Greedy-based Cross-Matching (GCM) algorithm, which combines profile attributes with linkage information of both friend and non-friend users. In the GCM algorithm, we first propose a greedy strategy for detecting candidate matching users using Profile Attributes Similarity (PAS) and User Surrounding Score (USS). We then define the User Matching Score (UMS), which combines PAS with network structures, to greedily determine matched users for the candidate ones. Finally, we utilize a novel cross-matching process inspired by Stable Marriage Problem (SMP) to further improve the matching accuracy. Experiments on Twitter and Facebook demonstrate that our method significantly improves the matching performance and outperforms the state-of-the-art algorithms.

辽ICP备05001357号 地址:中国·辽宁省大连市甘井子区凌工路2号 邮编:116024
版权所有:大连理工大学