Research on Recognition Algorithm of important Nodes in Complex Network | Zendy

Yue Su | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Research on Recognition Algorithm of important Nodes in Complex Network

Author(s) -

Yue Su

Publication year - 2020

Publication title -

informatica

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.172

H-Index - 34

eISSN - 1854-3871

pISSN - 0350-5596

DOI - 10.31449/inf.v44i1.3031

Subject(s) - computer science , partition (number theory) , algorithm , complex network , node (physics) , sort , closeness , basis (linear algebra) , data mining , artificial intelligence , mathematics , engineering , combinatorics , mathematical analysis , geometry , structural engineering , world wide web , information retrieval

It is very important to identify the important nodes in the network. On the basis of K-shell algorithm, this study studied the recognition of important nodes in complex networks. Firstly, this study introduced concepts of edge weight and influence coefficient, designed an IKS algorithm, and analyzed its recognition effect in Zachary network and real micro blog network. It was found from the experimental results 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 closeness centralization and PaperRank algorithm. The partition results in 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 makes some contributions to the recognition of important nodes in complex network.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research