| 注册
首页|期刊导航|现代电子技术|基于改进K-shell的复杂网络关键节点识别方法

基于改进K-shell的复杂网络关键节点识别方法

李天雨 滕桂法 姚竟发

现代电子技术2025,Vol.48Issue(7):95-103,9.
现代电子技术2025,Vol.48Issue(7):95-103,9.DOI:10.16652/j.issn.1004-373x.2025.07.014

基于改进K-shell的复杂网络关键节点识别方法

Complex network′s key node identification based on improved K-shell method

李天雨 1滕桂法 1姚竟发2

作者信息

  • 1. 河北农业大学 信息科学与技术学院,河北 保定 071001
  • 2. 河北软件职业技术学院 软件工程系,河北 保定 071000
  • 折叠

摘要

Abstract

In the study of complex networks,accurate identification of key nodes in the network is particularly important for deeply grasping the structural characteristics and functional mechanisms of the network,as well as enhancing the stability and security of the operation of complex networks.The traditional K-shell method is based only on the location information of the node in the network,so the sorting results are too coarse-grained,which makes the node discrimination inconspicuous.In addition,it only considers the influence of the redundancy,and the number of outer nodes of the same layer nodes is assumed to be the same,which limits the accuracy and resolution of the evaluation results.In view of the above,this paper proposes a new key node identification method.This method comprehensively considers the local influence on the basis of the idea of the original K-shell algorithm,and supplements the influence of neighbor nodes and sub-neighbor nodes on the importance of the identified nodes.Firstly,the K-shell algorithm is used to determine the global influence of the nodes and calculate the Ks value of each node.Secondly,the influence of the neighbor nodes of the identified nodes is determined by the degree centrality algorithm,and the influence of the sub-neighbor nodes is characterized by the products of their influence coefficients and quantities.Finally,the local influence of the nodes is evaluated by considering the role of neighbor nodes and sub-neighbor nodes comprehensively.Specifically,the influence of neighbor nodes is quantified by their degree centrality,and the influence of sub-neighbor nodes is characterized by the products of their influence coefficients and quantities.Finally,the method is verified on 6 real networks with correlation,monotonicity and robustness as evaluation criteria.The verification results show that the proposed method can identify key nodes in complex networks more efficiently and accurately and has higher resolution and accuracy in comparison with the current mainstream methods.

关键词

复杂网络/K-shell/度中心性/关键节点识别/邻居节点/节点影响力

Key words

complex network/K-shell/degree centrality/key node identification/neighbor node/node influence

分类

信息技术与安全科学

引用本文复制引用

李天雨,滕桂法,姚竟发..基于改进K-shell的复杂网络关键节点识别方法[J].现代电子技术,2025,48(7):95-103,9.

基金项目

国家自然科学基金项目(U20A20180) (U20A20180)

河北省人力资源和社会保障课题(JRS-2023-3078) (JRS-2023-3078)

现代电子技术

OA北大核心

1004-373X

访问量0
|
下载量0
段落导航相关论文