一种基于改进K-shell的节点重要性排序方法
发布时间：2018-07-22 15:05
【摘要】：对复杂网络中节点的重要性进行排序在理论和现实中都有着重要的意义。传统K-shell分解方法有着排序结果分辨率不高的缺陷,针对这一问题,提出了一种改进的K-shell方法,通过利用K-shell分解过程中节点被删除时的迭代层数来进一步区分不同节点的重要性程度。在三类不同的现实网络中的实验表明,该方法能够有效解决传统方法的缺陷,在提高排序结果分辨率的同时有着较好的时间复杂度。
[Abstract]:Ranking the importance of nodes in complex networks is of great significance both in theory and in practice. The traditional K-shell decomposition method has the defect of low resolution of sorting result. In order to solve this problem, an improved K-shell method is proposed. By using the number of iterative layers when nodes are deleted during K-shell decomposition, the importance of different nodes is further distinguished. Experiments in three different real networks show that the proposed method can effectively solve the shortcomings of traditional methods and has better time complexity while improving the resolution of sorting results.
【作者单位】： 国家数字交换系统工程技术研究中心;
【基金】：国家自然科学基金资助项目(61171108) 国家“973”计划资助项目(2012CB315901,2012CB315905) 国家科技支撑计划资助项目(2014BAH30B01)
【分类号】：O157.5
，
本文编号：2137852
[Abstract]:Ranking the importance of nodes in complex networks is of great significance both in theory and in practice. The traditional K-shell decomposition method has the defect of low resolution of sorting result. In order to solve this problem, an improved K-shell method is proposed. By using the number of iterative layers when nodes are deleted during K-shell decomposition, the importance of different nodes is further distinguished. Experiments in three different real networks show that the proposed method can effectively solve the shortcomings of traditional methods and has better time complexity while improving the resolution of sorting results.
【作者单位】： 国家数字交换系统工程技术研究中心;
【基金】：国家自然科学基金资助项目(61171108) 国家“973”计划资助项目(2012CB315901,2012CB315905) 国家科技支撑计划资助项目(2014BAH30B01)
【分类号】：O157.5
，
本文编号：2137852
本文链接：https://www.wllwen.com/kejilunwen/yysx/2137852.html
