Abstract
Community detection is a classic and essential task in complex network analysis which aims at understanding their structural properties and functional organization. Community detection based on overlapping nodes has become one of the most popular methods in recent years. But, how to define the overlapping nodes in the real network is an important job. In this paper, we use the speaker-listener label propagation algorithm to find overlapping nodes. Second, we proposed a new metric which is based on local and global attributes to measure the node influence so as to evaluate the overlapping nodes' importance. Community detection is realized with the k-lowest-influence overlapping nodes deleting. Then, we assign the removed nodes into specific communities by voting to find the final community structure. The voting strategy is based on choosing the specific communities containing most of their neighbors. Finally, the extensive experiments on real-world networks demonstrate that our proposed method improves the quality of community detection methods and show both the effectiveness and efficiency of the method.