Author:
Qie Hang,Li Shijie,Dou Yong,Xu Jinwei,Xiong Yunsheng,Gao Zikai
Abstract
AbstractCommunity detection is a vital task in many fields, such as social networks, and financial analysis, to name a few. The Louvain method, the main workhorse of community detection, is a popular heuristic method based on modularity. But it is difficult for the sequential Louvain method to deal with large-scale graphs. In order to overcome the drawback, researchers have proposed several parallel Louvain methods (Parallel Louvain Method, PLM), which suffer two challenges: (1) latency in the information synchronization and (2) communities swap. To tackle these two challenges, we propose a graph partition algorithm for the parallel Louvain method. Different from existing graph partition algorithms, our graph partition algorithm divides the graph into subgraphs called isolate sets, in which vertices are relatively decoupled from others, and the PLM computes and synchronizes information without delay and communities swap. We first describe concepts and properties of isolate sets. In the second place, we propose an algorithm to divide the graph into isolate sets, which enjoys the same computation complexity as the breadth-first search. Finally, we propose the isolate-set-based parallel Louvain method, which calculates and updates vertices information without latency and communities swap. We implement our method with OpenMP on an 8-cores PC. Experiments on 18 graphs show that our parallel method achieves a maximum 4.62 $$\times $$
×
speedup compared with the sequential method, and outputs higher modularity on 14 graphs.
Publisher
Springer Science and Business Media LLC
Reference42 articles.
1. Girvan, M. & Newman, M. E. J. Community structure in social and biological networks. Proce. Natl. Acad. Sci. 99(12), 7821–7826. https://doi.org/10.1073/pnas.122653799 (2002).
2. Flake, G.W., Lawrence, S., & Lee Giles, C. Efficient identification of web communities. In Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 150–160 (2000).
3. Flake, G.W., Lawrence, S., Giles, C.L., & Coetzee, F.M. Self-organization and identification of web communities. Computer35(3), 66–70 (2002). https://doi.org/10.1109/2.989932.
4. Airoldi, E.M., Blei, D.M., Fienberg, S.E., & Xing, E.P. Mixed membership stochastic blockmodels. J. Mach. Learn. Res.. 9(Sep), 1981–2014 (2008).
5. Mehta, N., Carin, L., & Rai, P. Stochastic blockmodels meet graph neural networks. arXiv:1905.05738 (2019).
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献