| 本文已被：浏览 4648次 下载 10177次 |
码上扫一扫！ |
|
|
| 复杂网络大数据中重叠社区检测算法 |
|
乔少杰1, 韩楠2, 张凯峰3, 邹磊4, 王宏志5, Louis Alberto GUTIERREZ6
|
|
1.成都信息工程大学 信息安全工程学院, 四川 成都 610225;2.成都信息工程大学 管理学院, 四川 成都 610103;3.西南交通大学 信息科学与技术学院, 四川 成都 611756;4.北京大学 计算机科学技术研究所, 北京 100871;5.哈尔滨工业大学 计算机科学与技术学院, 黑龙江 哈尔滨 150006;6.Department of Computer Science, Rensselaer Polytechnic Institute, New York, USA
|
|
| 摘要: |
| 提出一种新的面向复杂网络大数据的重叠社区检测算法DOC（detecting overlapping communities over complex network big data），时间复杂度为O（nlog2（n）），算法基于模块度聚类和图计算思想，应用新的节点和边的更新方法，利用平衡二叉树对模块度增量建立索引，基于模块度最优的思想设计一种新的重叠社区检测算法.相对于传统的重叠节点检测算法，对每个节点分析的频率大为降低，可以在较低的算法运行时间下获得较高的识别准确率.复杂网络大数据集上的算法测试结果表明：DOC算法能够有效地检测出网络重叠社区，社区识别准确率较高，在大规模LFR基准数据集上其重叠社区检测标准化互信息指标NMI最高能达到0.97，重叠节点检测指标F-score的平均值在0.91以上，且复杂网络大数据下的运行时间明显优于传统算法. |
| 关键词: 复杂网络 大数据 重叠社区检测 模块度 图计算 |
| DOI：10.13328/j.cnki.jos.005155 |
| 分类号:TP311 |
| 基金项目:国家自然科学基金（61100045，61363037）；教育部人文社会科学研究规划基金（15YJAZH058）；教育部人文社会科学研究青年基金（14YJCZH046）；成都市软科学项目（2015-RK00-00059-ZF）；四川省教育厅资助科研项目（14ZB0458） |
|
| Algorithm for Detecting Overlapping Communities from Complex Network Big Data |
|
QIAO Shao-Jie1, HAN Nan2, ZHANG Kai-Feng3, ZOU Lei4, WANG Hong-Zhi5, Louis Alberto GUTIERREZ6
|
|
1.College of Information Security Engineering, Chengdu University of Information Technology, Chengdu 610225, China;2.School of Management, Chengdu University of Information Technology, Chengdu 610103, China;3.School of Information Science and Technology, Southwest Jiaotong University, Chengdu 611756, China;4.Institute of Computer Science and Technology, Peking University, Beijing 100871, China;5.Department of Computer Science and Technology, Harbin Institute of Technology, Harbin 150006, China;6.Department of Computer Science, Rensselaer Polytechnic Institute, New York, USA
|
| Abstract: |
| Currently, the number of Internet users, along with complex networks including online social networks and electronic commerce networks, is growing explosively. To effectively and efficiently detecting overlapping community structure from complex network, big data plays an essential role in point of interest recommendation and hotspot propagation. In this study, a new algorithm over complex networks is proposed to detecting overlapping communities with a time complexity of O(nlog2(n)). The algorithm applies a new method for updating node and edge modularity based on the techniques of modularity clustering and graph computing. Balanced binary tree is used to index the modularity increment, and an overlapping community detection approach is provided based on the idea of modularity optimization to reduce the frequency of node analysis compared to traditional approaches. Experiments are conducted on real complex network big data, and the results show that the DOC algorithm can effectively detect overlapping communities with high accuracy, the normalized mutual information (NMI) can reach to 0.97 in large-scale LFR benchmark datasets, and the overlapping community detecting standard F-score value is averagely higher than 0.91. In addition, the runtime efficiency beats traditional approaches in complex network big data. |
| Key words: complex network big data overlapping community detection modularity graph computing |
