期刊文献+

社交网络中同一用户的识别 被引量:1

Identification of Same User in Social Networks
下载PDF
导出
摘要 对不同社交全局网络中同一用户的身份识别进行了相关研究,将社交网络建模为节点带有属性值且含有一个中心节点的网络,即ego-network,并就社交网络中身份识别的问题设计了相关算法。为挖掘同一个用户的节点对,对用户的属性、好友关系的相似度进行了建模,从而综合评价了不同社交网络中节点间的相似度,即为用户匹配评分,将其作为节点匹配的优先度;然后通过改进后的RCM算法得到全局最优的匹配结果;最后剪掉用户匹配评分较低的已匹配用户对以达到更好的效果。基于真实数据集,实验对比了该算法与几种相关算法的表现,并分析了不同参数对实验效果的影响,验证了所提算法的合理性。 This paper carried on the related research of the same user identification in different social global networks.The social network was modeled as a network with attribute value and a central node,namely ego-network.And aiming at the identification problem in the social network,this paper designed related algorithm.In order to mine the node pairs of the same user,the user’s attributes and the similarity of the friends’ relationship are modeled,so as to comprehensively evaluate the similarities among the nodes in different social networks,namely,to get the user match score and to use it in node matching.Then through the improved RCM algorithm,the global optimal matching results are obtained, and finally the matching user pairs with lower user match scores are cut off to achieve better results.Based on real datasets,the performance of the algorithm is compared with several related algorithms.The effect of different parameters on experimental results is also analyzed and the rationality of the proposed algorithm is verified.
作者 张征 王宏志 丁小欧 李建中 高宏 ZHANG Zheng;WANG Hong-zhi;DING Xiao-ou;LI Jian-zhong;GAO Hong(Department of Computer Science and Technology,Harbin Institute of Technology,Harbin 150001,China)
出处 《计算机科学》 CSCD 北大核心 2019年第9期93-98,共6页 Computer Science
基金 国家自然科学基金重点项目(U1509216),国家自然科学基金面上项目(61472099,61602129)资助 国家重点研发计划项目(2016YFB1000703)
关键词 社交网络 用户识别 用户属性 RCM算法 Social networks User identification User attributes RCM algorithm
  • 相关文献

参考文献2

二级参考文献15

  • 1Newman M E J. Fast algorithm for detecting communitystructure in networks[J]. Physical Review E, 2004, 69(6):066133-1-066133-5.
  • 2Lancichinetti A, Fortunato S, and Kertesz J. Detecting theoverlapping and hierarchical community structure in complexnetworks[J]. New Journal of Physics, 2009, 11(3):033015-1-033015-18.
  • 3Fallani F D V, Nicosia V, Latora V, et al.. Nonparametricresampling of random walks for spectral network clustering[J].Physical Review E, 2014, 89(1): 012802-1-012802-5.
  • 4Xu Xiao-wei, Yuruk N, Feng Zhi-dan, et al. SCAN: astructural clustering algorithm for networks[C]. Proceedingsof the 13th ACM SIGKDD International Conference onKnowledge Discovery and Data Mining, San Jose, 2007:824-833.
  • 5Zhou Deng-yong, Huang Jia-yuan, and Schdlkopf B. Learningfrom labeled and unlabeled data on a directed graph[C].Proceedings of the 22nd International Conference on MachineLearning, Bonn, 2005: 1036-1043.
  • 6Meila M and Pentney W. Clustering by weighted cuts indirected graphs[C]. Proceedings of the 7th SIAMInternational Conference on Data Mining, Minneapolis, 2007:135-144.
  • 7Ene A, Im S, and Moseley B. Fast clustering usingMapReduce[C]. Proceedings of the 17th ACM SIGKDDInternational Conference on Knowledge Discovery and DataMining, San Diego, 2011: 681-689.
  • 8Cao Yan, Cao Jian, and Li Ming-lu. Distributed datadistribution mechanism in social network based on fuzzyclustering[J]. Foundations and Applications of IntelligentSystems, 2014, 213: 603-620.
  • 9Chen Jia-jun, Chen Ji-meng, Liu Jie, et ai. PSCAN: aparallel structural clustering algorithm for networks[C].Proceedings of the 2013 International Conference on MachineLearning and Cybernetics, Tianjin, 2013: 839-844.
  • 10Zhao Wei-zhong, Venkataswamy M, and Xu Xiao-wei.PSCAN: a parallel structural clustering algorithm for bignetworks in mapReduce[C]. Proceedings of the 2013 IEEE27th International Conference on Advanced InformationNetworking and Applications, Washington DC, 2013:862-869.

共引文献20

同被引文献2

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部