Detecting overlapping communities in networks via dominant label propagation |
| |
Authors: | Sun He-Li;Huang Jian-Bin;Tian Yong-Qiang;Song Qin-Bao;Liu Huai-Liang |
| |
Affiliation: | a Department of Computer Science and Technology, Xi'an Jiaotong University, Xi'an 710049, China;b State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210023, China;c School of Software, Xidian University, Xi'an 710071, China;d School of Economics and Management, Xidian University, Xi'an 710071, China |
| |
Abstract: | Community detection is an important methodology for understanding the intrinsic structure and function of a realworld network.In this paper,we propose an effective and efficient algorithm,called Dominant Label Propagation Algorithm(Abbreviated as DLPA),to detect communities in complex networks.The algorithm simulates a special voting process to detect overlapping and non-overlapping community structure in complex networks simultaneously.Our algorithm is very efficient,since its computational complexity is almost linear to the number of edges in the network.Experimental results on both real-world and synthetic networks show that our algorithm also possesses high accuracies on detecting community structure in networks. |
| |
Keywords: | overlapping community detection dominant label propagation complex network |
本文献已被 CNKI 等数据库收录! |
| 点击此处可从《中国物理 B》浏览原始摘要信息 |
|
点击此处可从《中国物理 B》下载免费的PDF全文 |
|