Detecting algorithm based on prior knowledge and modularity for networked community structure

On the basis of analyzing the modularity and Newman detecting algorithm for network community structure, an algorithm based on prior knowledge and modularity (PKM) is put forward to detect community structure. An original community division is acquired by using the prior knowledge of the structure of social networks, such as the degree of the node, and then the communities are combined so as to get a clarified partition. Through calculation of computer simulation networks, Ucinet networks and Chinese rural-urban migrants social networks, the results indicate that the number of iterations of the proposed algorithm is reduced nearly by 50% compared to that of Newman's, and the higher modularity can be yielded.