Online community detection for large complex networks

Authors:
Wangsheng Zhang;Gang Pan;Zhaohui Wu;Shijian Li
Affiliations:
Department of Computer Science, Zhejiang University, China;Department of Computer Science, Zhejiang University, China;Department of Computer Science, Zhejiang University, China;Department of Computer Science, Zhejiang University, China
Venue:
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Year:
2013

Citing 8
Cited 0

Graphs over time: densification laws, shrinking diameters and possible explanations

Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Graph evolution: Densification and shrinking diameters

ACM Transactions on Knowledge Discovery from Data (TKDD)
On Modularity Clustering

IEEE Transactions on Knowledge and Data Engineering
Empirical comparison of algorithms for network community detection

Proceedings of the 19th international conference on World wide web
Modular community detection in networks

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
A convex formulation of modularity maximization for community detection

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Line orthogonality in adjacency eigenspace with application to community partition

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Community detection in social networks through community formation games

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three

Quantified Score

Hi-index	0.00

Visualization

Abstract

Complex networks describe a wide range of systems in nature and society. To understand the complex networks, it is crucial to investigate their internal structure. In this paper, we propose an online community detection method for large complex networks, which make it possible to process networks edge-by-edge in a serial fashion. We investigate the generative mechanism of complex networks and propose a split mechanism based on the degree of the nodes to create new community. Our method has linear time complexity. The method has been applied to six real-world network datasets and the experimental results show that it is comparable to existing methods in modularity with much less running time.