arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2204.00451cs.SIcs.HC
收藏

动态图形可视化的在线力导向算法

Online force-directed algorithms for visualization of dynamic graphs

Se-Hang Cheong, Yain-Whar Si

摘要:

力导向(FD)算法可用于探索社交网络中的关系,可视化货币市场和分析交易网络。然而,FD算法主要设计用于可视化静态图,其中网络的拓扑在整个计算过程中保持不变。与静态图相比,动态图中的节点和边可以随着时间的推移而添加或删除。在这些情况下,现有的FD算法不能很好地扩展,因为拓扑中的任何变化都会触发这些算法完全重新启动整个计算。为了缓解这个问题,我们提出了五个在线FD算法的设计和实现,以可视化动态图,同时保持其原生的力模型。本文提出的在线FD算法能够重用现有FD算法的力模型,而无需进行重大修改。为了评估所提出的方法的有效性,在线FD算法与静态FD算法的可视化动态图进行了比较。实验结果表明,在五个算法评估,在线FD算法实现了最好的数量的边缘交叉和标准偏差的边缘长度的可视化动态图形。

英文摘要:

Force-directed (FD) algorithms can be used to explore relationships in social networks, visualize money markets, and analyze transaction networks. However, FD algorithms are mainly designed for visualizing static graphs in which the topology of the networks remains constant throughout the calculation. In contrast to static graphs, nodes and edges in dynamic graphs can be added or removed as time progresses. In these situations, existing FD algorithms do not scale well, since any changes in the topology will trigger these algorithms to completely restart the entire computation. To alleviate this problem, we propose a design and implementation of five online FD algorithms to visualize dynamic graphs while maintaining their native force models. The online FD algorithms developed in this paper are able to reuse the force models of existing FD algorithms without significant modifications. To evaluate the effectiveness of the proposed approach, online FD algorithms are compared against static FD algorithms for visualizing dynamic graphs. Experimental results show that among the five algorithms evaluated, the online FD algorithm achieves the best number of edge crossings and the standard deviation of edge lengths for visualizing dynamic graphs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑