An improved graph layout algorithm of embedded node attributes

被引：0

作者：

Tang, Ying ^{[1
]}

Wang, Bin ^{[1
]}

Fan, Jing ^{[1
]}

机构：

[1] School of Computer Science and Technology, Zhejiang University of Technology, Hangzhou,310023, China

来源：

Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics | 2016年 / 28卷 / 02期

关键词：

Attribute distances - Clustering - Elasticity coefficients - Force-directed layout - Graph layout algorithms - Mapping functions - Monotonic functions - Node attribute;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

The traditional graph layout algorithm mainly considers the topology of a graph to generate visually-aesthetic layout results. However without considering the node attribute, the traditional graph layout results can not accurately reflect the impact of the node attribute. Aiming at this problem, this paper proposed an improved graph layout algorithm based on the embedded node attributes. We first define the distance metric between nodes in the node attributes space (including data attribute and topology attribute of the node). Then we define three linear monotonic functions mapping node attribute distances to three force parameters of the force-directed layout algorithm, i. e. gravitation, spring elasticity coefficient and spring original length. According to specific node attributes, we design and calculate the corresponding attribute distance function and the linear monotonic mapping functions to obtain the node-attributes related graph layout results. Finally we apply our algorithm to visualize the Douban movie data and the real political blog data. The experimental results show that the layouts of this algorithm can fully reflect the influence of node attributes, revealing the important node relationships or interesting sub-graph structures associated with node attributes. © 2016, Institute of Computing Technology. All right reserved.

引用

页码：228 / 237