On Time and Space: An Experimental Study on Graph Structural and Temporal Encodings

V. Filipov, Alessio Arleo, M. Bögl, S. Miksch
{"title":"On Time and Space: An Experimental Study on Graph Structural and Temporal Encodings","authors":"V. Filipov, Alessio Arleo, M. Bögl, S. Miksch","doi":"10.48550/arXiv.2208.13716","DOIUrl":null,"url":null,"abstract":"Dynamic networks reflect temporal changes occurring to the graph's structure and are used to model a wide variety of problems in many application fields. We investigate the design space of dynamic graph visualization along two major dimensions: the network structural and temporal representation. Significant research has been conducted evaluating the benefits and drawbacks of different structural representations for static graphs, however, few extend this comparison to a dynamic network setting. We conduct a study where we assess the participants' response times, accuracy, and preferences for different combinations of the graph's structural and temporal representations on typical dynamic network exploration tasks, with and without support of common interaction methods. Our results suggest that matrices provide better support for tasks on lower-level entities and basic interactions require longer response times while increasing accuracy. Node-link with auto animation proved to be the quickest and most accurate combination overall, while animation with playback control the most preferred temporal encoding.","PeriodicalId":159831,"journal":{"name":"International Symposium Graph Drawing and Network Visualization","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium Graph Drawing and Network Visualization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2208.13716","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Dynamic networks reflect temporal changes occurring to the graph's structure and are used to model a wide variety of problems in many application fields. We investigate the design space of dynamic graph visualization along two major dimensions: the network structural and temporal representation. Significant research has been conducted evaluating the benefits and drawbacks of different structural representations for static graphs, however, few extend this comparison to a dynamic network setting. We conduct a study where we assess the participants' response times, accuracy, and preferences for different combinations of the graph's structural and temporal representations on typical dynamic network exploration tasks, with and without support of common interaction methods. Our results suggest that matrices provide better support for tasks on lower-level entities and basic interactions require longer response times while increasing accuracy. Node-link with auto animation proved to be the quickest and most accurate combination overall, while animation with playback control the most preferred temporal encoding.
论时间与空间:图结构与时间编码的实验研究
动态网络反映了图的结构发生的时间变化,并在许多应用领域中用于建模各种各样的问题。我们从网络结构和时间表征两个主要维度研究动态图形可视化的设计空间。已经进行了重要的研究,评估了静态图的不同结构表示的优缺点,然而,很少将这种比较扩展到动态网络设置。我们进行了一项研究,在典型的动态网络探索任务中,我们评估了参与者对图的结构和时间表示的不同组合的响应时间、准确性和偏好,有和没有共同交互方法的支持。我们的研究结果表明,矩阵为低级实体上的任务提供了更好的支持,基本交互需要更长的响应时间,同时提高了准确性。节点链接和自动动画被证明是最快和最准确的组合,而带有播放控制的动画是最受欢迎的时间编码。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书