A Computational Model which Learns to Selectively Attend in Category Learning

Lingyun Zhang, G. Cottrell
{"title":"A Computational Model which Learns to Selectively Attend in Category Learning","authors":"Lingyun Zhang, G. Cottrell","doi":"10.1109/DEVLRN.2005.1490981","DOIUrl":null,"url":null,"abstract":"Shepard et al. (1961) made empirical and theoretical investigation of the difficulties of different kinds of classifications using both learning and memory tasks. As the difficulty rank mirrors the number of feature dimensions relevant to the category, later researchers took it as evidence that category learning includes learning how to selectively attend to only useful features, i.e. learning to optimally allocate the attention to those dimensions relative to the category (Rosch and Mervis, 1975). We built a recurrent neural network model that sequentially attended to individual features. Only one feature is explicitly available at one time (as in Rehder and Hoffman's eye tracking settings (Render and Hoffman, 2003)) and previous information is represented implicitly in the network. The probabilities of eye movement from one feature to the next is kept as a fixation transition table. The fixations started randomly without much bias on any particular feature or any movement. The network learned the relevant feature(s) and did the classification by sequentially attending to these features. The rank of the learning time qualitatively matched the difficulty of the categories","PeriodicalId":297121,"journal":{"name":"Proceedings. The 4nd International Conference on Development and Learning, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. The 4nd International Conference on Development and Learning, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DEVLRN.2005.1490981","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Shepard et al. (1961) made empirical and theoretical investigation of the difficulties of different kinds of classifications using both learning and memory tasks. As the difficulty rank mirrors the number of feature dimensions relevant to the category, later researchers took it as evidence that category learning includes learning how to selectively attend to only useful features, i.e. learning to optimally allocate the attention to those dimensions relative to the category (Rosch and Mervis, 1975). We built a recurrent neural network model that sequentially attended to individual features. Only one feature is explicitly available at one time (as in Rehder and Hoffman's eye tracking settings (Render and Hoffman, 2003)) and previous information is represented implicitly in the network. The probabilities of eye movement from one feature to the next is kept as a fixation transition table. The fixations started randomly without much bias on any particular feature or any movement. The network learned the relevant feature(s) and did the classification by sequentially attending to these features. The rank of the learning time qualitatively matched the difficulty of the categories
分类学习中选择性学习的计算模型
Shepard et al.(1961)利用学习和记忆任务对不同类型分类的难度进行了实证和理论研究。由于难度等级反映了与类别相关的特征维度的数量,后来的研究者将其作为证据,认为类别学习包括学习如何选择性地只关注有用的特征,即学习如何将注意力最佳地分配到相对于类别的这些维度上(Rosch和Mervis, 1975)。我们建立了一个递归神经网络模型,按顺序处理各个特征。一次只有一个特征是明确可用的(如Rehder和Hoffman的眼动追踪设置(Render and Hoffman, 2003)),之前的信息隐式地表示在网络中。眼球从一个特征移动到下一个特征的概率被保存为注视转移表。注视开始是随机的,对任何特定的特征或任何运动没有太多的偏见。网络学习相关的特征,并通过顺序地关注这些特征来进行分类。学习时间的排名与类别的难度有质的匹配
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信