A Review of Community Detection Algorithms Based on Modularity Optimization

Abstract

Community structure is considered to be one of the most important features of the real network. Community detection helps to understand the real construction of the network and can better analyze various complex systems. In this paper, five algorithms based on module degree optimization (GN, FN, CNM, Louvain, SML) are introduced. The ideas and design principles of this algorithms are introduced in detail, and the characteristics and advantages and disadvantages of each method are summarized. Finally, the prospect of this kind of algorithm is summarized.