系统工程与电子技术

• 通信与网络 • 上一篇    下一篇

基于节点中心性的时变复杂网络布局算法

周弦1,2,3, 梁霄1,2, 黄廷磊1,2   

  1. 1. 中国科学院电子学研究所,北京 100190; 2. 中国科学院空间信息处理与应用系统
    技术重点实验室,北京 100190; 3. 中国科学院大学,北京 100049
  • 出版日期:2017-09-27 发布日期:2010-01-03

Time-varying complex network layout algorithm based on node centrality

ZHOU Xian1,2,3, LIANG Xiao1,2, HUANG Tinglei1,2   

  1. 1. Institute of Electronics, Chinese Academy of Sciences, Beijing 100190, China; 2. Key Laboratory of
    Technology in GeoSpatial Information Processing and Application System, Chinese Academy of
    Sciences, Beijing 100190, China; 3. University of Chinese Academy of Sciences, Beijing 100049, China
  • Online:2017-09-27 Published:2010-01-03

摘要:

目前,时变网络布局算法主要从网络结构和美学指标出发维持用户意象图,并没有考虑节点中心性的影响。为此,将嵌入节点中心性改进传统静态网络布局算法为时变网络布局算法。首先,引用节点半局部中心性指标改进PageRank算法来评估节点的中心性;然后,根据节点的中心性和稳定度来计算动态半径作为节点的约束因子;最后,在静态网络布局算法中加入控制节点移动的约束因子,形成基于节点中心性的时变网络布局算法。实验结果表明,所提方法可以在保存用户意象图和美学标准间达到平衡,且对大型时变网络也具有良好的计算能力。

Abstract:

The current time-varying network layout algorithm mainly preserves the mental graph from the network structure and the aesthetic quality, without considering the influence of the node centrality. The force-directed algorithm to the time-varying network layout algorithm by embeding node centrality is improved. Firstly, the PageRank algorithm is used to evaluate the centrality of the nodes by referring to semi-local centrality. Then, the dynamic range is calculated as the constraint factor of nodes according to its centrality and stability. Finally, the time-varying network layout algorithm based on node centrality is formed by the static force-directed algorithm via the constraint of the dynamic range. The experimental results show that the proposed approach can balance the mental map and aesthetic quality, and also own good computational capability for large time-varying networks.