系统仿真学报 ›› 2017, Vol. 29 ›› Issue (5): 1028-1032.doi: 10.16182/j.issn1004731x.joss.201705013

• 仿真应用工程 • 上一篇    下一篇

基于相似性模块度的层次聚合社区发现算法

占文威, 席景科, 王志晓   

  1. 中国矿业大学计算机学院, 江苏 徐州 221116
  • 收稿日期:2016-04-30 修回日期:2016-08-08 出版日期:2017-05-08 发布日期:2020-06-03
  • 作者简介:占文威(1990-),男,湖北,硕士,研究方向为数据挖掘;席景科(1972-),男,河南,博士,副教授,研究方向为数据挖掘。
  • 基金资助:
    国家自然科学基金(61402482), 中国博士后基金(2015T80555), 江苏省博士后基金(1501012A)

Hierarchical Agglomerative Community Detection Algorithm Based on Similarity Modularity

Zhan Wenwei, Xi Jingke, Wang Zhixiao   

  1. College of Computer Science and Technology, China University of Mining and Technology, Xuzhou 221116, China
  • Received:2016-04-30 Revised:2016-08-08 Online:2017-05-08 Published:2020-06-03

摘要: Fast Unfolding是一种基于模块度优化的层次聚合社区发现算法,其优点是运行速度很快,不足之处是准确度有待提升,这是因为该算法采用传统模块度作为合并社区的衡量标准,而传统模块度函数在计算时只考虑节点间的链接信息,忽略邻居节点的影响,导致会出现两个节点共同邻居较多但由于节点间链接信息较弱不能被合并的情况,从而影响结果的准确度。针对该不足之处,通过引入优化后的相似度来改进Fast Unfolding算法的模块度函数,提出一种基于相似性模块度的层次聚合社区发现算法,并采用归一化互信息量即NMI(Normalized Mutual Information)作为评价算法准确性的指标,在真实网络和LFR(Lancichinetti Fortunato Radicchi)人工合成网络上进行实验,结果表明改进算法检测社区结构的准确度有明显改善。

关键词: Fast Unfolding算法, 模块度, 节点相似度, 社区发现

Abstract: Fast Unfolding is a hierarchical community detection algorithm based on modularity. It runs very fast, but the accuracy needs to be improved. Because the algorithm adopts traditional modularity to merger communities, it only considers node link information and ignores the neighbor nodes. Therefore, two nodes that have common neighbors and weak link information may not be merged, thus affecting the accuracy. In view of the shortcomings, a hierarchical agglomerative community detection algorithm based on similarity modularity was proposed through introducing optimized similarity to improve the modularity. It adopts NMI as the accuracy measurement. Experiments on the real network and LFR synthetic network show that the accuracy of detecting community is obviously improved.

Key words: fast unfolding algorithm, modularity, similarity, community detection

中图分类号: