Matching user identities across social networks with limited profile data

来源 :计算机科学前沿 | 被引量 : 0次 | 上传用户:xiaoxunjun
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
Privacy preservation is a primary concern in so-cial networks which employ a variety of privacy preservations mechanisms to preserve and protect sensitive user informa-tion including age,location,education,interests,and others.The task of matching user identities across different social networks is considered a challenging task.In this work,we propose an algorithm to reveal user identities as a set of linked accounts from different social networks using limited user profile data,i.e.,user-name and friendship.Thus,we propose a framework,ExpandUIL,that includes three standalone al-gorithms based on(i)the percolation graph matching in Ex-pandFullName algorithm,(ii)a supervised machine learning algorithm that works with the graph embedding,and(iii)a combination of the two,ExpandUserLinkage algorithm.The proposed framework as a set of algorithms is significant as,(i)it is based on the network topology and requires only name feature of the nodes,(ii)it requires a considerably low initial seed,as low as one initial seed suffices,(iii)it is iterative and scalable with applicability to online incoming stream graphs,and(iv)it has an experimental proof of stability over a real ground-truth dataset.Experiments on real datasets,Instagram and VK social networks,show upto 75%recall for linked ac-counts with 96%accuracy using only one given seed pair.
其他文献
True random number generators(TRNG)are im-portant counterparts to pseudorandom number generators(PRNG),especially for high security applications such as cryptog