Community-Detection Method of Complex Network Based on Node Influence Analysis

Abstract

Community detection can help analyze the structural features and functions of complex networks, and plays important roles in many aspects such as project recommendation and network evolution analysis. Therefore, community detection has always been a hot topic in the field of complex networks. Although various community-detection methods have been proposed, how to improve their accuracy and efficiency is still an ambition pursued by researchers. In view of this, this paper proposes a community-detection method for complex networks based on node influence analysis. First, the influence of nodes is represented as a vector composed by neighborhood degree centrality, betweennes centrality and clustering coefficient. Then, Pareto dominance is used to rank the influence of nodes. After that, the community centers are selected by comprehensively considering the node influence and crowding degree. Finally, the remaining nodes are allocated to different communities using a labeling algorithm. The proposed method in this paper is applied to several actual networks. The comparison results with other methods demonstrate the effectiveness of the proposed method.