Shandong Science ›› 2019, Vol. 32 ›› Issue (2): 130-136.doi: 10.3976/j.issn.1002-4026.2019.02.017

• Other Research Article • Previous Articles     Next Articles

An ranking method for nodes in complex networks based on neighbor nodes and the lines——NL centrality algorithm

LIU Shu-lei1,DU Jia-le2,SHAO Zeng-zhen1,3*   

  1. 1.Shandong Normal University,Jinan 250014, China;2.Jinan Licheng NO.1 Middle School,Jinan 250115,China; 3.Shandong Women's University, Jinan 250002,China
  • Received:2018-03-03 Published:2019-04-20 Online:2019-04-02

Abstract: A multi-attribute ranking method based on neighbor nodes and lines,NL centrality algorithm,was proposed in this paper. NL centrality algorithm not only utilized the number of neighbors and sub-neighbors to further distinguish the node position, but also fully considered the effect of lines upon the importance of a node. The experimental results show that our proposed NL centrality algorithm can outperform well-known centralities in terms of accuracy and efficiency.

Key words: complex network, node influence capability, neighbor node, importance of line

CLC Number: 

  • TP301.6

Open Access This article is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0), which permits third parties to freely share (i.e., copy and redistribute the material in any medium or format) and adapt (i.e., remix, transform, or build upon the material) the articles published in this journal, provided that appropriate credit is given, a link to the license is provided, and any changes made are indicated. The material may not be used for commercial purposes. For details of the CC BY-NC 4.0 license, please visit: https://creativecommons.org/licenses/by-nc/4.0