摘要
基于无向无权复杂网络理论,提出一种基于m阶邻居节点重要度贡献的节点重要度评估方法.在综合考虑了节点自身的属性,节点在网络中的位置以及m阶邻居节点的度重要度贡献和介数重要度贡献后,提出m阶邻居节点重要度贡献系数矩阵概念,建立评估模型.通过实验并和其他算法结果进行对比分析,表明所提出的评估方法具有可行性和更高的精确性.当m的取值接近网络的平均路径长度时,节点的重要度评估趋于稳定,可有效提高评估效率.
Based on the theory of undirected and unweighted complex networks, a node importance evaluation method based on importance contribution of m -order neighbor nodes is proposed. After considering the properties of the node itself, the position of the node in the network and the contribution of the degree and betweenness from m -order neighbor nodes, the concept of the important degree contribution coefficient matrix of m -order neighbor nodes is put forward and the evaluation model is established . It is concluded that the proposed method is feasible and more accurate through experimental analysis and comparison with other algorithms. When the value of m is close to the average path length of the network, the evaluation results of the degree of importance of the nodes tends to be stable , which can effectively improve the evaluation efficiency.
作者
王锋
许梁煌
郑玉芳
WANG Feng;XU Lianghuang;ZHENG Yufang(College of Civil Engineering,Fuzhou University,Fuzhou,Fujian 350108,China)
出处
《福州大学学报（自然科学版）》
CAS
北大核心
2019年第2期237-243,共7页
Journal of Fuzhou University(Natural Science Edition)
基金
国家自然科学基金资助项目(51308126)
关键词
复杂网络
关键节点
m阶邻居矩阵
贡献矩阵
评估效率
complex network
key nodes
m -order neighborhood matrix
contribution matrix
evaluation efficiency
作者简介
通讯作者:王锋(1973-),男,博士,副教授,主要从事道路交通工程方面的研究, wangf0524@163.com.
