Community Detection by Node Betweenness and Similarity in Complex Network

Community detection of complex networks has always been a hot issue. With the mixed parameters mu increase in network complexity, community detection algorithms need to be improved. Based on previous work, the paper designs a novel algorithm from the perspective of node betweenness properties and gives the detailed steps of the algorithm and simulation results. We compare the proposed algorithm with a series of typical algorithms through experiments on synthetic and actual networks. Experimental results on artificial and real networks demonstrate the effectiveness and superiority of our algorithm.

Automated summary

This paper presents a novel algorithm based on node betweenness properties, and experimental results demonstrate its effectiveness and superiority in community detection.