title: Online community detection for large complex networks.
abstract: Complex networks describe a wide range of systems in nature and society. To understand complex networks, it is crucial to investigate their community structure. In this paper, we develop an online community detection algorithm with linear time complexity for large complex networks. Our algorithm processes a network edge by edge in the order that the network is fed to the algorithm. If a new edge is added, it just updates the existing community structure in constant time, and does not need to re-compute the whole network. Therefore, it can efficiently process large networks in real time. Our algorithm optimizes expected modularity instead of modularity at each step to avoid poor performance. The experiments are carried out using 11 public data sets, and are measured by two criteria, modularity and NMI (Normalized Mutual Information). The results show that our algorithm's running time is less than the commonly used Louvain algorithm while it gives competitive performance.
authors: Department of Computer Science, Zhejiang University, Hangzhou, Zhejiang, China.
authors: Gang
authors: G
authors: Pan
authors: Department of Computer Science, Zhejiang University, Hangzhou, Zhejiang, China.
authors: Wangsheng
authors: W
authors: Zhang
authors: Department of Computer Science, Zhejiang University, Hangzhou, Zhejiang, China.
authors: Zhaohui
authors: Z
authors: Wu
authors: Department of Computer Science, Zhejiang University, Hangzhou, Zhejiang, China.
authors: Shijian
authors: S
authors: Li
mesh_terms: D000465:Algorithms; D019058:Community Networks; D006801:Humans; D020407:Internet; D008962:Models, Theoretical; D012919:Social Behavior