The Community Structure Discovery Algorithm Study Based On The Core Members

In recent years,the complex network become a hotspot in the research of many scholars,many areas of complex networks are gradually rise,the node importance of sorting and community structure is divided into two separate areas of complex networks,but shares a connection between them,the core node may be a small community at the heart of the corporate,core members may also be of the more important node in the network.This paper studies from the following three aspects: The traditional Ks decomposition algorithm and MDD algorithm is improved,this paper proposes a Ks value algorithm,can better sort of nodes.For community structure was studied.With the help of the universal gravitation formula proposed a new similarity measure applied to the community structure,and puts forward a new algorithm is proposed.A new algorithm of the core node into consideration,the combined new sorting algorithm to get the results of the screening out of a certain amount of core members,and thus in the use of similarity for community.In view of the patent cooperation network is studied.First of all,through the analysis of the data collection draw the network diagram,and analyzes the characteristics of network.Second,build model of the construction of the network,and through the experimental simulation.Finally using the node importance algorithm and community structure discovery algorithm on the patent cooperation network.