Improving Louvain Algorithm for Community Detection

DOI

10.2991/aiea-16.2016.20How to use a DOI?

Keywords

Community detection; Louvain; LPA; Modularity; Time complexity.

Abstract

Community is one of the important characteristics of reality network, which can effectively reflect the inner information of network and the relation among nodes. For the division of the community there already had many effective algorithms, the Louvain algorithm based modularity is a more popular community discovery algorithm because it can divide network into different hierarchical community structure quickly and efficiently. But, with the increasing size of network, the Louvain algorithm still has a serious problem that has relatively high time complexity in handling massive data. Faced with this situation, in this paper we ensure the merit of the Louvain algorithm and combine with the LPA algorithm which has advantage of effectiveness, proposing an improved algorithm integrating the Louvain algorithm with the LPA algorithm. Through later experiments, the improved algorithm can obviously decrease time complexity, reduce execution time, and ensure the result accuracy compared to original Louvain algorithm.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Bin Hu
AU  - Wenmin Li
AU  - Xuesong Huo
AU  - Ye Liang
AU  - Minghui Gao
AU  - Pei Pei
PY  - 2016/11
DA  - 2016/11
TI  - Improving Louvain Algorithm for Community Detection
BT  - Proceedings of the 2016 International Conference on Artificial Intelligence and Engineering Applications
PB  - Atlantis Press
SP  - 110
EP  - 115
SN  - 2352-538X
UR  - https://doi.org/10.2991/aiea-16.2016.20
DO  - 10.2991/aiea-16.2016.20
ID  - Hu2016/11
ER  -