已入深夜,您辛苦了!由于当前在线用户较少,发布求助请尽量完整的填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!祝你早点完成任务,早点休息,好梦!

Scanpath Trend Analysis on Web Pages

计算机科学 聚类分析 眼动 网页 可用性 路径(计算) 目视进近 情报检索 人工智能 万维网 人机交互 程序设计语言 工程类 航空航天工程
作者
Şükrü Eraslan,Yeli̇z Yeşi̇lada,Simon Harper
出处
期刊:ACM Transactions on The Web [Association for Computing Machinery]
卷期号:10 (4): 1-35 被引量:44
标识
DOI:10.1145/2970818
摘要

Eye tracking studies have widely been used in improving the design and usability of web pages and in the research of understanding how users navigate them. However, there is limited research in clustering users’ eye movement sequences (i.e., scanpaths) on web pages to identify a general direction they follow. Existing research tends to be reductionist, which means that the resulting path is so short that it is not useful. Moreover, there is little work on correlating users’ scanpaths with visual elements of web pages and the underlying source code, which means the result cannot be used for further processing. In order to address these limitations, we introduce a new concept in clustering scanpaths called Scanpath Trend Analysis (STA) that not only considers the visual elements visited by all users, but also considers the visual elements visited by the majority in any order. We present an algorithm which automatically does this trend analysis to identify a trending scanpath for multiple web users in terms of visual elements of a web page. In contrast to existing research, the STA algorithm first analyzes the most visited visual elements in given scanpaths, clusters the scanpaths by arranging these visual elements based on their overall positions in the individual scanpaths, and then constructs a trending scanpath in terms of these visual elements. This algorithm was experimentally evaluated by an eye tracking study on six web pages for two different kinds of tasks (12 cases in total). Our experimental results show that the STA algorithm generates a trending scanpath that addresses the reductionist problem of existing work by preventing the loss of commonly visited visual elements for all cases. Based on the statistical tests, the STA algorithm also generates a trending scanpath that is significantly more similar to the inputted scanpaths compared to other existing work in 10 out of 12 cases. In the remaining cases, the STA algorithm still performs significantly better than some other existing work. This algorithm contributes to behavior analysis research on the web that can be used for different purposes: for example, re-engineering web pages guided by the trending scanpath to improve users’ experience or guiding designers to improve their design.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
量子星尘发布了新的文献求助10
2秒前
材料打工人完成签到 ,获得积分10
4秒前
duyu完成签到 ,获得积分10
4秒前
4秒前
喜悦冬易完成签到,获得积分10
5秒前
熬夜的昆虫希望明天能好关注了科研通微信公众号
6秒前
完美世界应助han采纳,获得10
7秒前
云也发布了新的文献求助10
10秒前
13秒前
14秒前
无花果应助白白不焦虑采纳,获得10
16秒前
16秒前
Nan发布了新的文献求助10
16秒前
17秒前
18秒前
18秒前
毕烨华发布了新的文献求助10
19秒前
咻咻发布了新的文献求助10
19秒前
果果完成签到,获得积分10
19秒前
21秒前
gkhsdvkb完成签到 ,获得积分10
22秒前
han发布了新的文献求助10
22秒前
素月分辉发布了新的文献求助10
22秒前
善学以致用应助多年以后采纳,获得10
23秒前
27秒前
小二郎应助ENDER123采纳,获得10
27秒前
司空豁发布了新的文献求助10
27秒前
galaxy完成签到 ,获得积分10
28秒前
dandna完成签到 ,获得积分10
29秒前
多年以后发布了新的文献求助10
30秒前
勤恳的访梦完成签到,获得积分10
32秒前
BINGBING发布了新的文献求助10
33秒前
量子星尘发布了新的文献求助10
34秒前
zhenzheng完成签到 ,获得积分10
35秒前
小蘑菇应助精灵夜雨采纳,获得10
37秒前
37秒前
39秒前
开心的幼珊完成签到 ,获得积分10
39秒前
han完成签到,获得积分10
41秒前
42秒前
高分求助中
The Oxford Encyclopedia of the History of Modern Psychology 2000
Chinesen in Europa – Europäer in China: Journalisten, Spione, Studenten 1200
Deutsche in China 1920-1950 1200
Applied Survey Data Analysis (第三版, 2025) 850
Mineral Deposits of Africa (1907-2023): Foundation for Future Exploration 800
 Introduction to Comparative Public Administration Administrative Systems and Reforms in Europe, Third Edition 3rd edition 590
Learning to Listen, Listening to Learn 570
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 物理 生物化学 纳米技术 计算机科学 化学工程 内科学 复合材料 物理化学 电极 遗传学 量子力学 基因 冶金 催化作用
热门帖子
关注 科研通微信公众号,转发送积分 3881405
求助须知:如何正确求助?哪些是违规求助? 3423832
关于积分的说明 10736143
捐赠科研通 3148707
什么是DOI,文献DOI怎么找? 1737394
邀请新用户注册赠送积分活动 838811
科研通“疑难数据库(出版商)”最低求助积分说明 784107