基于邻域K-shell分布的关键节点识别方法  

Key Nodes Identification Method Based on Neighborhood K-shell Distribution

作　　者：吴亚丽[1,2] 任远光 董昂 周傲然 吴学金 郑帅龙 WU Yali;REN Yuanguang;DONG Ang;ZHOU Aoran;WU Xuejin;ZHENG Shuailong(School of Automation and Information Engineering,Xi’an University of Technology,Xi’an 710048,China;Shaanxi Province Key Laboratory of Complex System Control and Intelligent Information Processing,Xi’an 710048,China)

机构地区：[1]西安理工大学自动化与信息工程学院,西安710048 [2]陕西省复杂系统控制与智能信息处理重点实验室,西安710048

出　　处：《计算机工程与应用》2024年第2期87-95,共9页Computer Engineering and Applications

基　　金：陕西省重点研发计划(2021JM-343)。

摘　　要：复杂网络中关键节点的精准识别对于网络结构稳定和信息传播起着至关重要的作用。传统K-shell方法仅通过节点在网络中所处位置对节点的重要性进行评估,导致区分度不高。基于此,综合考虑了节点的全局信息和局部信息对节点重要性的影响,提出一种基于邻域K-shell分布的关键节点识别方法。该方法通过节点邻域Ks值定义节点的熵,从而反映邻居节点的K-shell分布特征。通过11个网络数据集上的仿真实验,验证了所提方法能够更准确地识别并区分复杂网络中的关键节点。Accurate identification of key nodes in complex networks plays a crucial role in network structure stability and information dissemination.The traditional K-shell algorithm only evaluates the importance of nodes’location,resulting in low differentiation.Considering the influence of global information and local information of nodes comprehensively,an identification algorithm of key nodes based on the K-shell distribution of neighborhood is proposed.The entropy of the node is defined by the Ks value of neighborhood to reflect the K-shell distribution characteristics of the neighbors.The results on 11 network datasets demonstrate the accuracy of proposed method.

关 键 词：复杂网络 关键节点 K-SHELL 易感-感染-恢复模型(SIR) 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]