Testing the Limits of the Spatial Approach: Comparing Retrieval and Revisitation Performance of Spatial and Paged Data Organizations for Large Item Sets

C. Gutwin, M. Kamp, J. Storring, A. Cockburn, Cody J. Phillips
{"title":"Testing the Limits of the Spatial Approach: Comparing Retrieval and Revisitation Performance of Spatial and Paged Data Organizations for Large Item Sets","authors":"C. Gutwin, M. Kamp, J. Storring, A. Cockburn, Cody J. Phillips","doi":"10.20380/GI2020.22","DOIUrl":null,"url":null,"abstract":"Finding and revisiting objects in visual content collections is common in many analytics tasks. For large collections, filters are often used to reduce the number of items shown, but many systems generate a new ordering of the items for every filter update – and these changes make it difficult for users to remember the locations of important items. An alternative is to show the entire dataset in a spatially-stable layout, and show filter results with highlighting. The spatial approach has been shown to work well with small datasets, but little is known about how spatial memory scales to tasks with hundreds of items. To investigate the scalability of spatial presentations, we carried out a study comparing finding and re-finding performance with two data organizations: pages of items that re-generate item ordering with each filter change, and a spatially-stable organization that presents all 700 items at once. We found that although overall times were similar, the spatial interface was faster for revisitation, and participants used fewer filters than in the paged interface as they gained familiarity with the data. Our results add to previous work by showing that spatial interfaces can work well with datasets of hundreds of items, and that they better support a transition to fast revisitation using spatial memory.","PeriodicalId":93493,"journal":{"name":"Proceedings. Graphics Interface (Conference)","volume":"33 1","pages":"215-224"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. Graphics Interface (Conference)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.20380/GI2020.22","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Finding and revisiting objects in visual content collections is common in many analytics tasks. For large collections, filters are often used to reduce the number of items shown, but many systems generate a new ordering of the items for every filter update – and these changes make it difficult for users to remember the locations of important items. An alternative is to show the entire dataset in a spatially-stable layout, and show filter results with highlighting. The spatial approach has been shown to work well with small datasets, but little is known about how spatial memory scales to tasks with hundreds of items. To investigate the scalability of spatial presentations, we carried out a study comparing finding and re-finding performance with two data organizations: pages of items that re-generate item ordering with each filter change, and a spatially-stable organization that presents all 700 items at once. We found that although overall times were similar, the spatial interface was faster for revisitation, and participants used fewer filters than in the paged interface as they gained familiarity with the data. Our results add to previous work by showing that spatial interfaces can work well with datasets of hundreds of items, and that they better support a transition to fast revisitation using spatial memory.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
测试空间方法的极限:比较大项目集的空间和页面数据组织的检索和重访性能
查找和重新访问可视化内容集合中的对象在许多分析任务中都很常见。对于大型集合,过滤器通常用于减少显示的项目数量,但是许多系统在每次过滤器更新时都会生成项目的新顺序—这些更改使用户难以记住重要项目的位置。另一种方法是在空间稳定的布局中显示整个数据集,并突出显示过滤器结果。空间记忆法已经被证明可以很好地处理小数据集,但对于空间记忆如何扩展到包含数百个项目的任务,我们知之甚少。为了研究空间表示的可扩展性,我们进行了一项研究,比较了两种数据组织的查找和重新查找性能:随着每次过滤器更改而重新生成项排序的项页面,以及一次显示所有700项的空间稳定组织。我们发现,尽管总体时间相似,但空间界面的重访速度更快,参与者使用的过滤器比页面界面少,因为他们熟悉了数据。我们的研究结果为之前的工作提供了补充,表明空间接口可以很好地处理数百个项目的数据集,并且它们更好地支持使用空间记忆向快速重访的过渡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
2.20
自引率
0.00%
发文量
0
期刊最新文献
Towards Enabling Blind People to Fill Out Paper Forms with a Wearable Smartphone Assistant. BayesGaze: A Bayesian Approach to Eye-Gaze Based Target Selection. Personal+Context navigation: combining AR and shared displays in network path-following Interactive Exploration of Genomic Conservation AffordIt!: A Tool for Authoring Object Component Behavior in Virtual Reality
×
引用
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