Exploring density regions for analyzing dynamic graph data

Q3 Computer Science
Michael Burch
{"title":"Exploring density regions for analyzing dynamic graph data","authors":"Michael Burch","doi":"10.1016/j.jvlc.2017.09.007","DOIUrl":null,"url":null,"abstract":"<div><p>Static or dynamic graphs are typically visualized by either node-link diagrams, adjacency matrices<span>, adjacency lists<span>, or hybrids thereof. In particular, for the case of a changing graph structure a viewer wishes to be able to visually compare the graphs in a sequence. Doing such a comparison task rapidly and reliably demands for visually analyzing the dynamic graph for certain dynamic patterns. In this paper we describe a novel dynamic graph visualization that is based on the concept of smooth density fields generated by first splatting the link information of a given graph in a certain layout or visual metaphor. To further visually enhance the time-varying graph structures we add user-adaptable isolines to the resulting dynamic graph representation. The computed visual encoding of the dynamic graph is aesthetically appealing due to its smooth curves and can additionally be used to do comparisons in a long graph sequence, i.e., from an information visualization perspective it serves as an overview representation supporting to start more detailed analysis processes. To demonstrate the usefulness of the technique we explore real-world dynamic graph data by taking into account visual parameters like visual metaphors, node-link layouts, smoothing iterations, number of isolines, and different color codings. In this extended work we additionally incorporate matrix and list splatting while also supporting the selection of density regions with overlaid link information. Moreover, from the selected graph the user can automatically apply region comparisons with other graphs based on global and local density properties. Such a feature is in particular useful for finding commonalities, hence serving as a special filtering function.</span></span></p></div>","PeriodicalId":54754,"journal":{"name":"Journal of Visual Languages and Computing","volume":"44 ","pages":"Pages 133-144"},"PeriodicalIF":0.0000,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.jvlc.2017.09.007","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Visual Languages and Computing","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1045926X17301817","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 2

Abstract

Static or dynamic graphs are typically visualized by either node-link diagrams, adjacency matrices, adjacency lists, or hybrids thereof. In particular, for the case of a changing graph structure a viewer wishes to be able to visually compare the graphs in a sequence. Doing such a comparison task rapidly and reliably demands for visually analyzing the dynamic graph for certain dynamic patterns. In this paper we describe a novel dynamic graph visualization that is based on the concept of smooth density fields generated by first splatting the link information of a given graph in a certain layout or visual metaphor. To further visually enhance the time-varying graph structures we add user-adaptable isolines to the resulting dynamic graph representation. The computed visual encoding of the dynamic graph is aesthetically appealing due to its smooth curves and can additionally be used to do comparisons in a long graph sequence, i.e., from an information visualization perspective it serves as an overview representation supporting to start more detailed analysis processes. To demonstrate the usefulness of the technique we explore real-world dynamic graph data by taking into account visual parameters like visual metaphors, node-link layouts, smoothing iterations, number of isolines, and different color codings. In this extended work we additionally incorporate matrix and list splatting while also supporting the selection of density regions with overlaid link information. Moreover, from the selected graph the user can automatically apply region comparisons with other graphs based on global and local density properties. Such a feature is in particular useful for finding commonalities, hence serving as a special filtering function.

探索用于分析动态图形数据的密度区域
静态或动态图通常通过节点链接图、邻接矩阵、邻接列表或其混合来可视化。特别地,对于改变图结构的情况,观看者希望能够在视觉上比较序列中的图。快速而可靠地进行这样的比较任务需要对某些动态模式的动态图进行可视化分析。在本文中,我们描述了一种新的动态图可视化,该可视化基于平滑密度场的概念,该概念是通过首先在特定布局或视觉隐喻中泼洒给定图的链接信息而生成的。为了进一步在视觉上增强时变图结构,我们在生成的动态图表示中添加了用户可适应的等值线。动态图的计算视觉编码由于其平滑的曲线而在美学上具有吸引力,并且可以另外用于在长图序列中进行比较,即,从信息可视化的角度来看,它充当支持启动更详细的分析过程的概览表示。为了证明该技术的有用性,我们通过考虑视觉参数(如视觉隐喻、节点链接布局、平滑迭代、等值线数量和不同的颜色编码)来探索真实世界的动态图形数据。在这项扩展工作中,我们还加入了矩阵和列表飞溅,同时还支持选择具有重叠链接信息的密度区域。此外,从所选的图中,用户可以基于全局和局部密度特性自动应用与其他图的区域比较。这样的特征对于寻找共性特别有用,因此用作特殊的过滤函数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Visual Languages and Computing
Journal of Visual Languages and Computing 工程技术-计算机:软件工程
CiteScore
1.62
自引率
0.00%
发文量
0
审稿时长
26.8 weeks
期刊介绍: The Journal of Visual Languages and Computing is a forum for researchers, practitioners, and developers to exchange ideas and results for the advancement of visual languages and its implication to the art of computing. The journal publishes research papers, state-of-the-art surveys, and review articles in all aspects of visual languages.
×
引用
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学术官方微信