Research on Recognition Algorithm of important Nodes in Complex Network
Abstract
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.DOI:
https://doi.org/10.31449/inf.v44i1.3031Downloads
Published
How to Cite
Issue
Section
License
Authors retain copyright in their work. By submitting to and publishing with Informatica, authors grant the publisher (Slovene Society Informatika) the non-exclusive right to publish, reproduce, and distribute the article and to identify itself as the original publisher.
All articles are published under the Creative Commons Attribution license CC BY 3.0. Under this license, others may share and adapt the work for any purpose, provided appropriate credit is given and changes (if any) are indicated.
Authors may deposit and share the submitted version, accepted manuscript, and published version, provided the original publication in Informatica is properly cited.







