当前位置: 首页 > 文章 > 一种基于度排序的节点重要性排序算法 河南科技学院学报(自然科学版) 2015,43 (2) 61-65
Position: Home > Articles > A method about node importance evaluation based on degree-rank Journal of Henan Institute of Science and Technology(Natural Science Edition) 2015,43 (2) 61-65

一种基于度排序的节点重要性排序算法

作  者:
张玫;解建军;冯科展
单  位:
河北师范大学数学与信息科学学院
关键词:
复杂网络;节点重要性;度;排序
摘  要:
为有效评估复杂网络中节点的重要性,特提出了一种基于经典度排序方法的合度排序算法.合度排序算法是在节点度的基础上提出了邻度和合度的概念,通过计算每个节点的合度值来评估节点在网络中的重要性,即合度值越大,节点在网络中的重要性越高.并利用经典的度排序算法、接近度排序算法及新提出的合度排序算法对同一网络拓扑图的节点进行排序,证明了合度排序算法的有效性.
译  名:
A method about node importance evaluation based on degree-rank
作  者:
Zhang Mei;Xie Jianjun;Feng Kezhan;College of Mathematics and Information Science,Hebei Normal University;Key Laboratory of Computational Mathematics and Applications;
关键词:
complex network;;node importance;;degree;;sorting
摘  要:
To effectively evaluate the importance of nodes in complex networks,a both degree sorting algorithm based on the classical degree sorting algorithm was proposed in this paper.Both degree sorting algorithm is proposed the concept of neighbor degree and both degree on the basis of the concept of node degree,through the calculation of both degree of each node to evaluate the importance of the nodes in the network,the higher the value of both degree,the more important position in the network.And by using the classical degree sorting and closeness sorting algorithms,and the new proposed both degree sorting algorithm on the same network topology node sorting,proving the validity of the proposed sorting algorithm.

相似文章

计量
文章访问数: 10
HTML全文浏览量: 0
PDF下载量: 0

所属期刊

推荐期刊