Abstract: In order to quickly and accurately partition the community of large\|scale social networks which were increasingly complicated, we proposed an improved algorithm based on similarity voting to replace the underlying partition of Louvain algorithm. It solved the shortcomings of Louvain algorithm such as slow convergence in the bottom partitioning and large number of double counting, which made the community partition more rapidly. The experimental results from real social network data show that compared with the Louvain algorithm, the efficiency of the improved algorithm is much higher, with less number of communities partitioned, and the community structure is more compact in the case of keeping the modularity basically unchanged.

Key words: community partition, similarity voting, social network, Louvain algorithm, modularity, community structure, number of communities