ISOCD: Overlapping community detection algorithm based on local influence and similarity

Abstract

Many nodes of a complex network in the real world belong to multiple communities. Research on the detection of overlapping communities with common nodes can help us understand the topology of network and extract information hidden in the network. Considering the problems of many existing overlapping community detection methods, such as high time complexity or poor division results, we propose an overlapping community detection method based on local influence and similarity (ISOCD). The ISOCD method selects seed nodes based on local influence, follows a greedy strategy, takes the fitness function of similarity as the optimization goal, and finally optimizes and merges the detected communities. In experiments, the method we propose has good community division effects both on the real-world and synthetic networks, and has low time complexity.