通过交互式链接的节点链接图和矩阵可视化进行动态图形探索。

4区 计算机科学 Q1 Arts and Humanities
Michael Burch, Kiet Bennema Ten Brinke, Adrien Castella, Ghassen Karray Sebastiaan Peters, Vasil Shteriyanov, Rinse Vlasvinkel
{"title":"通过交互式链接的节点链接图和矩阵可视化进行动态图形探索。","authors":"Michael Burch,&nbsp;Kiet Bennema Ten Brinke,&nbsp;Adrien Castella,&nbsp;Ghassen Karray Sebastiaan Peters,&nbsp;Vasil Shteriyanov,&nbsp;Rinse Vlasvinkel","doi":"10.1186/s42492-021-00088-8","DOIUrl":null,"url":null,"abstract":"<p><p>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.</p>","PeriodicalId":52384,"journal":{"name":"Visual Computing for Industry, Biomedicine, and Art","volume":"4 1","pages":"23"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8423958/pdf/","citationCount":"18","resultStr":"{\"title\":\"Dynamic graph exploration by interactively linked node-link diagrams and matrix visualizations.\",\"authors\":\"Michael Burch,&nbsp;Kiet Bennema Ten Brinke,&nbsp;Adrien Castella,&nbsp;Ghassen Karray Sebastiaan Peters,&nbsp;Vasil Shteriyanov,&nbsp;Rinse Vlasvinkel\",\"doi\":\"10.1186/s42492-021-00088-8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>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.</p>\",\"PeriodicalId\":52384,\"journal\":{\"name\":\"Visual Computing for Industry, Biomedicine, and Art\",\"volume\":\"4 1\",\"pages\":\"23\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-09-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8423958/pdf/\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Visual Computing for Industry, Biomedicine, and Art\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://doi.org/10.1186/s42492-021-00088-8\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"Arts and Humanities\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Visual Computing for Industry, Biomedicine, and Art","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.1186/s42492-021-00088-8","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Arts and Humanities","Score":null,"Total":0}
引用次数: 18

摘要

由于底层关系数据的各种属性和附加的时变属性,动态图的可视化是一项具有挑战性的任务。对于稀疏和小的图,最有效的可视化方法是节点链接图,而对于带有附加数据的密集图,邻接矩阵可能是更好的选择。由于图可以包含全局稀疏和局部密集这两种属性,因此将几种视觉隐喻以及静态和动态可视化结合起来是有益的。在本文中,描述了一种可视化和算法可扩展的方法,该方法提供了图形的视图和透视图,作为交互链接的节点链接和邻接矩阵可视化。作为该技术的新颖之处,可以使用来自一个或多个组合视图的集群或异常等见解来影响其他视图的布局或重新排序。此外,通过组合考虑多个布局和重新排序属性以及同一组节点的不同边缘属性,可以检测、计算和可视化节点和节点组的重要性。作为一个额外的特征集,随着时间的推移,提供了组、簇和离群值的自动识别,并且基于节点链接和矩阵可视化的可视化结果,扩展了支持的布局和矩阵重新排序技术的清单,并且在考虑图数据的动态时提供了更多的交互技术。最后,进行了一个小型用户实验来研究所提出方法的可用性。通过将所建议的工具应用于图形数据集,例如共同作者、共同引用和可理解Perl Archive Network发行版,可以说明该工具的有用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Dynamic graph exploration by interactively linked node-link diagrams and matrix visualizations.

Dynamic graph exploration by interactively linked node-link diagrams and matrix visualizations.

Dynamic graph exploration by interactively linked node-link diagrams and matrix visualizations.

Dynamic graph exploration by interactively linked node-link diagrams and matrix visualizations.

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.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Visual Computing for Industry, Biomedicine, and Art
Visual Computing for Industry, Biomedicine, and Art Arts and Humanities-Visual Arts and Performing Arts
CiteScore
5.60
自引率
0.00%
发文量
28
审稿时长
5 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信