The New Clustering Algorithm about Community Structure of Complex Networks Based on Modularity
Xiao Ling-j · 2014
In view of the traditional division of clustering algorithm to remove the side affects node, integrated the concept of K- means algorithm and improved it, a neighbor node as clustering optional collection, all community center node cluster synchronization clustering algorithm at the same time. The algorithm based on node degree of center and the shortest path rate determine community center node set, and then took the center node as community center, clustered the optional collection based on neighbor node, completed the division of network. Applied algorithms to Zachary network and compared with the GN algorithm and Top-Leader algorithm, the results show that this algorithm has a good division of the network.