基于k-core的大规模复杂网络压缩布局算法  

Compressing Layout Algorithm for Large Complex Network Based on k-core

作　　者：李甜甜 卢罡[1] 许南山[1] 郭俊霞[1] 

机构地区：[1]北京化工大学计算机科学与技术系,北京100029

出　　处：《计算机工程》2016年第5期308-312,共5页Computer Engineering

基　　金：北京高等学校青年英才计划基金资助项目(YETP0506)

摘　　要：为在复杂网络规模不断扩大的情况下优化其可视化布局效果,将力导引布局算法与k-core概念相结合,提出一种改进的大规模复杂网络压缩布局算法。利用复杂网络中的k-core概念划分网络数据,根据k-core值选择节点处理方式,实现网络节点的压缩布局。定义面向压缩的复杂网络信息量概念,对算法的压缩效果进行量化评估。实验结果表明,改进后的布局算法能有效利用有限的显示空间,减少布局结果中的边点密集现象,清晰地显示网络结构,同时在一定程度上保持原始网络性质。In order to optimize the visual layout effect of complex network while they become larger, by combining force-directed algorithm and k-core concept, this paper proposes an improved compressing lay algorithm for large complex network. The nodes are divided into various categories by k-core concept in a complex network,and they are handled in different ways by different k-core values. In this way, the scale of network nodes is decreased. In addition, this paper gives the definition of the compression oriented complex network information, which is used to measure the compressing effect quantitatively. Experimental results show that the proposed algorithm can effectively use limited display space, reduce the overlapping phenomenon in layout result, show the structure of the network clearly, and maintain the original network information.

关 键 词：复杂网络 可视化 布局算法 力导引算法 压缩布局 k-核 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]