Research On The Recognition Algorithm Of Important Nodes In Complex Network

It is crucial to identify the important nodes in the network. On the basis of the K-shell algorithm, this study researched the recognition of important nodes in complex networks. The study introduces concepts of edge weight and influence coefficient, the design of an IKS algorithm, and an analysis of its recognition effect in Zachary network and real micro blog network. The results showed that the partition results of the K-shell algorithm were coarse, while the partition results of the IKS algorithm were refined; the IKS algorithm could sort the important nodes accurately on the basis of the K-shell algorithm, and its rationality was higher than that of the closeness centralization and PaperRank algorithm. The partition results in the microblog network also verified the effectiveness of the improved method. The experimental results show that the IKS algorithm is reliable in the important node identification, which is beneficial to the recognition of important nodes in complex network.