BIG DATA RESEARCH 大数据
12
面向大规模图数据的并行图布局算法
程 致 远 ,鲍 玉 斌 ,冷 芳 玲
东北大学计算机科学系,辽宁 沈阳 110819
摘要
图模型是一种广泛使用的建模工具。图的可视化作为一种直观的图数据分析工具被广泛使用。图数据可视
化中最关键的技术是图布局算法,但是目前并没有高效的并行图布局算法,因此目前对于海量图数据的可
视化是一个挑战性问题。针对这一问题,在力导向布局算法基础上,忽略弱关联顶点间的斥力计算,提出了
k
-friend布局算法;并针对海量图数据设计了高效的并行图布局算法。在人工和实际数据集上的测试结果表
明,在布局质量降低可容忍的情况下,该算法大幅度提升了布局的速度。
关键词
力导向算法;可视化分析;社交网络;并行布局算法
中图分类号:TP391 文献标识码:A
doi: 10.11959/j.issn.2096-0271.2016050
Parallel graph layout algorithm for
large-scale graph data
CHENG Zhiyuan, BAO Yubin, LENG Fangling
Department of Computer Science of Northeastern University, Shenyang 110819, China
Abstract
Graph models are modeling tools which are widely used. Data visualization techniques have been widely used as
intuitive data analysis tools. Graph layout algorithm is the most critical technique of graph visualization, while there are
no effective parallel graph layout algorithms. So to study on visualization of massive graph data is a challenging problem.
Aiming at this problem, based on the force-directed layout algorithm and ignoring the repulsion force computation
between weakly associated vertexes partially, a
k
-friend approximate layout algorithm was proposed, and an effective
parallel layout algorithm was designed for massive graph data. The experimental results on artificial and real dataset
show that the algorithms proposed greatly improve the layout speed.
Key words
force-directed algorithm, visualization analysis, social network, parallel layout algorithm
2016016-1220160XX-22016016-122016025-122016016-122016050-1
评论0
最新资源