Me! Me! Me! Me! A study and comparison of ego network representations

IF 2.5 4区 计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING Computers & Graphics-Uk Pub Date : 2024-11-15 DOI:10.1016/j.cag.2024.104123
Henry Ehlers , Daniel Pahr , Velitchko Filipov , Hsiang-Yun Wu , Renata G. Raidou
{"title":"Me! Me! Me! Me! A study and comparison of ego network representations","authors":"Henry Ehlers ,&nbsp;Daniel Pahr ,&nbsp;Velitchko Filipov ,&nbsp;Hsiang-Yun Wu ,&nbsp;Renata G. Raidou","doi":"10.1016/j.cag.2024.104123","DOIUrl":null,"url":null,"abstract":"<div><div>From social networks to brain connectivity, ego networks are a simple yet powerful approach to visualizing parts of a larger graph, i.e. those related to a selected focal node — the so-called “ego”. While surveys and comparisons of general graph visualization approaches exist in the literature, we note (i) the many conflicting results of comparisons of adjacency matrices and node-link diagrams, thus motivating further study, as well as (ii) the absence of such systematic comparisons for ego networks specifically. In this paper, we propose the development of empirical recommendations for ego network visualization strategies. First, we survey the literature across application domains and collect examples of network visualizations to identify the most common visual encodings, namely straight-line, radial, and layered node-link diagrams, as well as adjacency matrices. These representations are then applied to a representative, intermediate-sized network and subsequently compared in a large-scale, crowd-sourced user study in a mixed-methods analysis setup to investigate their impact on both user experience and performance. Within the limits of this study, and contrary to previous comparative investigations of adjacency matrices and node-link diagrams (outside of ego networks specifically), <em>participants performed systematically worse when using adjacency matrices than those using node-link diagrammatic representations</em>. Similar to previous comparisons of different node-link diagrams, <em>we do not detect any notable differences in participant performance between the three node-link diagrams</em>. Lastly, our quantitative and qualitative results indicate that <em>participants found adjacency matrices harder to learn, use, and understand than node-link diagrams</em>. We conclude that in terms of both participant experience and performance, a layered node-link diagrammatic representation appears to be the most preferable for ego network visualization purposes.</div></div>","PeriodicalId":50628,"journal":{"name":"Computers & Graphics-Uk","volume":"125 ","pages":"Article 104123"},"PeriodicalIF":2.5000,"publicationDate":"2024-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Graphics-Uk","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0097849324002589","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

From social networks to brain connectivity, ego networks are a simple yet powerful approach to visualizing parts of a larger graph, i.e. those related to a selected focal node — the so-called “ego”. While surveys and comparisons of general graph visualization approaches exist in the literature, we note (i) the many conflicting results of comparisons of adjacency matrices and node-link diagrams, thus motivating further study, as well as (ii) the absence of such systematic comparisons for ego networks specifically. In this paper, we propose the development of empirical recommendations for ego network visualization strategies. First, we survey the literature across application domains and collect examples of network visualizations to identify the most common visual encodings, namely straight-line, radial, and layered node-link diagrams, as well as adjacency matrices. These representations are then applied to a representative, intermediate-sized network and subsequently compared in a large-scale, crowd-sourced user study in a mixed-methods analysis setup to investigate their impact on both user experience and performance. Within the limits of this study, and contrary to previous comparative investigations of adjacency matrices and node-link diagrams (outside of ego networks specifically), participants performed systematically worse when using adjacency matrices than those using node-link diagrammatic representations. Similar to previous comparisons of different node-link diagrams, we do not detect any notable differences in participant performance between the three node-link diagrams. Lastly, our quantitative and qualitative results indicate that participants found adjacency matrices harder to learn, use, and understand than node-link diagrams. We conclude that in terms of both participant experience and performance, a layered node-link diagrammatic representation appears to be the most preferable for ego network visualization purposes.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
我我!我!我自我网络表征的研究与比较
从社交网络到大脑连通性,"自我 "网络是一种简单而强大的方法,可用于可视化更大图形的各个部分,即与选定的焦点节点(即所谓的 "自我")相关的部分。虽然文献中存在对一般图形可视化方法的调查和比较,但我们注意到:(i) 在邻接矩阵和节点链接图的比较中存在许多相互矛盾的结果,因此需要进一步研究;(ii) 缺乏专门针对自我网络的系统性比较。在本文中,我们提出了关于自我网络可视化策略的经验性建议。首先,我们调查了各应用领域的文献,并收集了网络可视化实例,以确定最常见的可视化编码方式,即直线图、径向图、分层节点链接图以及邻接矩阵。然后,将这些表示法应用于一个具有代表性的中等规模网络,并在随后进行的大规模众包用户研究中通过混合方法分析设置进行比较,以研究它们对用户体验和性能的影响。在本研究的范围内,与以往对邻接矩阵和节点链接图(特别是在自我网络之外)的比较研究相反,参与者在使用邻接矩阵时的表现明显比使用节点链接图表示法时差。与之前对不同节点链接图的比较类似,我们没有发现三种节点链接图之间参与者表现的明显差异。最后,我们的定量和定性结果表明,参与者发现邻接矩阵比节点链接图更难学习、使用和理解。我们的结论是,就参与者的体验和表现而言,分层节点链接图似乎最适合用于自我网络可视化目的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computers & Graphics-Uk
Computers & Graphics-Uk 工程技术-计算机:软件工程
CiteScore
5.30
自引率
12.00%
发文量
173
审稿时长
38 days
期刊介绍: Computers & Graphics is dedicated to disseminate information on research and applications of computer graphics (CG) techniques. The journal encourages articles on: 1. Research and applications of interactive computer graphics. We are particularly interested in novel interaction techniques and applications of CG to problem domains. 2. State-of-the-art papers on late-breaking, cutting-edge research on CG. 3. Information on innovative uses of graphics principles and technologies. 4. Tutorial papers on both teaching CG principles and innovative uses of CG in education.
期刊最新文献
The phantom effect in information visualization Efficient inverse-kinematics solver for precise pose reconstruction of skinned 3D models Swarm manipulation: An efficient and accurate technique for multi-object manipulation in virtual reality Me! Me! Me! Me! A study and comparison of ego network representations Enhancing Visual Analytics systems with guidance: A task-driven methodology
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1