Burch Michael, Ten Brinke Kiet Bennema, Castella Adrien, Peters Ghassen Karray Sebastiaan, Shteriyanov Vasil, Vlasvinkel Rinse
Eindhoven University of Technology, 5600MB, Eindhoven, The Netherlands.
Vis Comput Ind Biomed Art. 2021 Sep 7;4(1):23. doi: 10.1186/s42492-021-00088-8.
The visualization of dynamic graphs is a challenging task owing to the various properties of the underlying relational data and the additional time-varying property. For sparse and small graphs, the most efficient approach to such visualization is node-link diagrams, whereas for dense graphs with attached data, adjacency matrices might be the better choice. Because graphs can contain both properties, being globally sparse and locally dense, a combination of several visual metaphors as well as static and dynamic visualizations is beneficial. In this paper, a visually and algorithmically scalable approach that provides views and perspectives on graphs as interactively linked node-link and adjacency matrix visualizations is described. As the novelty of this technique, insights such as clusters or anomalies from one or several combined views can be used to influence the layout or reordering of the other views. Moreover, the importance of nodes and node groups can be detected, computed, and visualized by considering several layout and reordering properties in combination as well as different edge properties for the same set of nodes. As an additional feature set, an automatic identification of groups, clusters, and outliers is provided over time, and based on the visual outcome of the node-link and matrix visualizations, the repertoire of the supported layout and matrix reordering techniques is extended, and more interaction techniques are provided when considering the dynamics of the graph data. Finally, a small user experiment was conducted to investigate the usability of the proposed approach. The usefulness of the proposed tool is illustrated by applying it to a graph dataset, such as e co-authorships, co-citations, and a Comprehensible Perl Archive Network distribution.
由于底层关系数据的各种属性以及额外的时变属性,动态图的可视化是一项具有挑战性的任务。对于稀疏和小型图,这种可视化最有效的方法是节点链接图,而对于带有附加数据的密集图,邻接矩阵可能是更好的选择。因为图可能同时包含全局稀疏和局部密集的属性,所以结合几种视觉隐喻以及静态和动态可视化是有益的。本文描述了一种在视觉和算法上可扩展的方法,该方法以交互式链接的节点链接图和邻接矩阵可视化的形式提供对图的视图和视角。作为这项技术的新颖之处,来自一个或几个组合视图的见解(如聚类或异常)可用于影响其他视图的布局或重新排序。此外,通过综合考虑几种布局和重新排序属性以及同一组节点的不同边属性,可以检测、计算并可视化节点和节点组的重要性。作为一个附加功能集,随着时间的推移提供了对组、聚类和离群值的自动识别,并且基于节点链接图和矩阵可视化的视觉结果,扩展了支持的布局和矩阵重新排序技术的全部内容,并且在考虑图数据的动态性时提供了更多的交互技术。最后,进行了一个小型用户实验来研究所提出方法的可用性。通过将其应用于图数据集(如共同作者关系、共引关系和可理解的Perl存档网络分布)来说明所提出工具的有用性。