首页> 外文会议>IEEE Symposium on Computers and Communications >A new model for nickname detection based on network structure and similarity propagation
【24h】

A new model for nickname detection based on network structure and similarity propagation

机译:基于网络结构和相似度传播的昵称检测新模型

获取原文

摘要

Users can participate in variety topics and express their opinions using different kinds of online applications, and the IDs (nickname) they used are usually virtual and difficult for finding the physical person. Which pose great challenges for network security management and user's online behavior supervision. Focus on this problem, we proposed methods for nickname detection based on the user's online connection structure and similarity propagation model. Firstly, we collected user's profile information from two popular online applications, sina microblog and RenRen network. Then we mark several matched pairs which belong to the same person from the applications with hardly manually effort, and those IDs are selected as seed set for nickname detection. Secondly, we proposed an nickname detection model based on the connection structure and similarity propagation. We selected one matched pairs from the seed set and obtain all their neighbors. Then we calculated the similarity of each pairs from the neighbor set and calculate their neighbors' connection similarity and neighbors' location similarity. If the similarity is bigger than a selected threshold, we claim they are matched pairs and insert them into the seed sets. On one hand, the correlation results can propagated based on the updated seed set. On the other hand, the computational complexity are greatly reduced as we only employ the neighbors' profiles to calculate the similarity. Experimental results verify the efficiency of the proposed method, which can lay a solid foundation for the online network management and user's behavior supervision.
机译:用户可以使用各种类型的在线应用程序来参与各种主题并表达意见,他们使用的ID(昵称)通常是虚拟的,很难找到自然人。这给网络安全管理和用户在线行为监控带来了巨大的挑战。针对这一问题,我们提出了一种基于用户在线连接结构和相似度传播模型的昵称检测方法。首先,我们从sina微博和RenRen网络这两个流行的在线应用程序中收集了用户的个人资料信息。然后,我们几乎不用人工标记应用程序中属于同一个人的几对匹配对,并选择这些ID作为种子集以进行昵称检测。其次,提出了一种基于连接结构和相似度传播的昵称检测模型。我们从种子集中选择了一对匹配的对,并获得了它们的所有邻居。然后,我们从邻居集合中计算出每一对的相似度,并计算它们的邻居的连接相似度和邻居的位置相似度。如果相似度大于选定的阈值,则我们认为它们是匹配对,并将其插入种子集中。一方面,可以基于更新的种子集传播相关结果。另一方面,由于我们仅使用邻居的配置文件来计算相似度,因此大大降低了计算复杂度。实验结果验证了所提方法的有效性,可为在线网络管理和用户行为监督打下坚实的基础。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号