计算机科学与探索 ›› 2012, Vol. 6 ›› Issue (2): 134-143.DOI: 10.3778/j.issn.1673-9418.2012.02.005

• 学术研究 • 上一篇    下一篇

动态加权网络中节点重要度评估

李玉华, 贺人贵, 钟 开, 李瑞轩   

  1. 华中科技大学 计算机科学与技术学院, 武汉 430074
  • 出版日期:2012-02-01 发布日期:2012-02-01

Node Importance Evaluation in Dynamic Weighted Network

LI Yuhua, HE Rengui, ZHONG Kai, LI Ruixuan   

  1. School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China
  • Online:2012-02-01 Published:2012-02-01

摘要: 目前节点重要度评估中针对静态无权图的研究比较多, 针对动态加权图的研究相对较少。针对加权网络提出了等效点权节点重要度评估方法; 考虑加权网络的动态性, 提出了动态距离矩阵更新算法; 结合动态规划和迭代的思想, 给出了一种新的求距离矩阵的方法; 考虑加权网络的社区性, 提出了基于距离增量的分组算法; 最后, 综合给出了基于距离增量分组的动态节点重要度评估算法(node importance evaluation based on distance-increment grouping in dynamic weighted network, IDGD), 通过在C-DBLP (digital bibliography & library project in China)数据上的对比实验, 验证了算法的可行性和有效性。

关键词: 节点重要度, 动态加权网络, 距离增量, 分组, 等效点权

Abstract: At present, most of research on node importance evaluation is concentrated on static un-weighted network. However, research on dynamic weighted network is not sufficient enough. For weighted networks, this paper proposes an equivalent point weight based node important evaluation method. According to the dynamics of weighted networks, it proposes a dynamic distance matrix updating algorithm. By considering the community structure of weighted networks, it also proposes a distance-increment based grouping algorithm. Finally, it puts forward synthetically a dynamic node importance evaluation algorithm based on distance-increment grouping, and validates the feasibility and effectiveness of the algorithm via contrast experiments on the data of C-DBLP (digital bibliogra-phy & library project in China).

Key words: node importance, dynamic weighted network, distance-increment, grouping, equivalent point weight