一种基于改进K-shell的节点重要性排序方法  

Method of node importance ranking based on improved K-shell

作　　者：邓凯旋 陈鸿昶[1] 黄瑞阳[1] 

机构地区：[1]国家数字交换系统工程技术研究中心,郑州450002

出　　处：《计算机应用研究》2017年第10期3017-3019,3084,共4页Application Research of Computers

基　　金：国家自然科学基金资助项目(61171108);国家"973"计划资助项目(2012CB315901;2012CB315905);国家科技支撑计划资助项目(2014BAH30B01)

摘　　要：对复杂网络中节点的重要性进行排序在理论和现实中都有着重要的意义。传统K-shell分解方法有着排序结果分辨率不高的缺陷,针对这一问题,提出了一种改进的K-shell方法,通过利用K-shell分解过程中节点被删除时的迭代层数来进一步区分不同节点的重要性程度。在三类不同的现实网络中的实验表明,该方法能够有效解决传统方法的缺陷,在提高排序结果分辨率的同时有着较好的时间复杂度。Ranking the importance of nodes in complex networks has great significance in both theory and reality. The traditional K-shell decomposition method has the defect of the sorting result with low resolution. In order to solve this problem, this paper proposed an improved K-shell method, which was used to further distinguish the importance of different nodes by using the number of iterations in the process of K-shell decomposition. Experiments on three different kinds of real networks show that the proposed method can effectively solve the defects of traditional methods, and has a better time complexity in improving the resolution of ranking results.

关 键 词：复杂网络 K-shell分解 节点重要性 迭代层数 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]