首页> 外文期刊>Information Processing & Management >Community detection using hierarchical clustering based on edge-weighted similarity in cloud environment
【24h】

Community detection using hierarchical clustering based on edge-weighted similarity in cloud environment

机译:云环境中基于边缘加权相似度的分层聚类社区检测

获取原文
获取原文并翻译 | 示例
       

摘要

Recently, social network has been paid more and more attention by people. Inaccurate community detection in social network can provide better product designs, accurate information recommendation and public services. Thus, the community detection (CD) algorithm based on network topology and user interests is proposed in this paper. This paper mainly includes two parts. In first part, the focused crawler algorithm is used to acquire the personal tags from the tags posted by other users. Then, the tags are selected from the tag set based on theTFIDFweighting scheme, the semantic extension of tags and the user semantic model. In addition, the tag vector of user interests is derived with the respective tag weight calculated by the improved PageRank algorithm. In second part, for detecting communities, an initial social network, which consists of the direct and unweighted edges and the vertexes with interest vectors, is constructed by considering the following/follower relationship. Furthermore, initial social network is converted into a new social network including the undirected and weighted edges. Then, the weights are calculated by the direction and the interest vectors in the initial social network and the similarity between edges is calculated by the edge weights. The communities are detected by the hierarchical clustering algorithm based on the edge-weighted similarity. Finally, the number of detected communities is detected by the partition density. Also, the extensively experimental study shows that the performance of the proposed user interest detection (PUID) algorithm is better than that ofCFalgorithm andTFIDFalgorithm with respect toF-measure, PrecisionandRecall. Moreover,Precisionof the proposed community detection (PCD) algorithm is improved, on average, up to 8.21% comparing with that ofNewmanalgorithm and up to 41.17% comparing with that ofCPMalgorithm.
机译:近年来,社交网络已经越来越受到人们的关注。社交网络中不正确的社区检测可以提供更好的产品设计,准确的信息推荐和公共服务。因此,本文提出了一种基于网络拓扑和用户兴趣的社区检测算法。本文主要包括两个部分。在第一部分中,聚焦爬虫算法用于从其他用户发布的标签中获取个人标签。然后,基于TFIDF加权方案,标签的语义扩展和用户语义模型,从标签集中选择标签。另外,利用通过改进的PageRank算法计算的各个标签权重来导出用户感兴趣的标签向量。在第二部分中,为了检测社区,通过考虑以下/从属关系,构造了一个初始社交网络,该社交网络由直接和未加权边缘以及带有兴趣向量的顶点组成。此外,最初的社交网络被转换为包括无方向和加权边缘的新社交网络。然后,通过初始社交网络中的方向和兴趣矢量来计算权重,并且通过边缘权重来计算边缘之间的相似性。通过基于边缘加权相似度的层次聚类算法检测社区。最后,通过分区密度来检测检测到的社区的数量。此外,广泛的实验研究表明,在F测度,精度和查全率方面,所提出的用户兴趣检测(PUID)算法的性能优于CF算法和TFID算法。此外,提出的社区检测(PCD)算法的精度平均比Newmanal算法提高了8.21%,与CPM算法相比提高了41.17%。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号