检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:胡钢[1] 卢志宇 王乐萌 许丽鹏 徐翔 任勇军[4] HU Gang;LU Zhi-yu;WANG Le-meng;XU Li-peng;XU Xiang;REN Yong-jun(School of Management Science and Engineering,Anhui University of Technology,Maanshan,Anhui 243032,China;School of Economics and Management,Southeast University,Nanjing,Jiangsu 211189,China;Science and Technology on Information Systems Engineering Laboratory,National University of Defense Technology,Changsha,Hunan 410073,China;School of Computer Science,Nanjing University of Information Science and Technology,Nanjing,Jiangsu 210044,China)
机构地区:[1]安徽工业大学管理科学与工程学院,安徽马鞍山243032 [2]东南大学经济管理学院,江苏南京211189 [3]国防科技大学信息系统工程重点实验室,湖南长沙410073 [4]南京信息工程大学计算机与软件学院,江苏南京210044
出 处:《电子学报》2023年第7期1956-1963,共8页Acta Electronica Sinica
基 金:国家自然科学基金(No.71772002);安徽省自然科学基金(No.2108085MG236);安徽省高校自然科学研究项目(No.KJ2021A0385)。
摘 要:为更精细化辨识节点重要性,本文研究节点多阶交互演化对节点重要性序结构形成的影响,提出基于复杂网络多阶邻域贡献度的节点重要性序结构辨识系统模型.首先,基于节点间不同阶层交互关系和节点多阶邻域规模异质性程度构建多阶邻域贡献度模型;通过节点多阶圈信息集结节点自身多阶邻域空间结构信息;其次,构建融合多阶邻域空间位置信息贡献和多阶圈信息贡献的节点重要性辨识系统模型,给出节点序结构辨识算法;最后,仿真分析表明在各真实网络中本文算法相比经典算法最高提升88%节点辨识率,以0.5资源投入进行网络攻击,分别最大提升67.47%,39.40%和20.17%攻击效用值.In order to finely identify the node importance,this paper studies the influence of node multi-order interac⁃tion evolution on node importance formation,and proposes a system model of node importance sequence structure identifi⁃cation based on multi-order neighborhood contribution of complex networks.Firstly,a multi-order neighborhood contribu⁃tion model is constructed based on different hierarchical interactions between nodes and the degree of heterogeneity of nodes'multi-order neighborhood scale;and characterize the nodes'own multi-order neighborhood spatial structure infor⁃mation by nodes'multi-order circle information.Secondly,a node importance identification model is constructed by inte⁃grating the contributions of multi-order neighborhood spatial location information and multi-order circle information,and a node order structure identification algorithm is given.Finally,the simulation analysis shows that this algorithm improves the node identification rate by up to 88%compared with the classical algorithm in each real network,and improves the at⁃tack utility value by up to 67.47%,39.40%and 20.17%with 0.5 resource input for network attacks,respectively.
关 键 词:复杂网络 节点重要性序结构 多阶邻域矩阵 圈结构贡献度 邻域k-shell值
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28