即时序列回忆中的空间聚类和层次编码

C. De Lillo, V. Lesk
{"title":"即时序列回忆中的空间聚类和层次编码","authors":"C. De Lillo, V. Lesk","doi":"10.1080/09541440902757918","DOIUrl":null,"url":null,"abstract":"Four experiments are reported that demonstrate the benefits of clustering by spatial proximity in spatial serial recall and provide support for the notion that hierarchical coding underpins the retention of clustered sequences in spatial working memory. Sequences segregated by spatial clusters increased serial recall performance at different levels of sequence length in a variation of the Corsi test and produced a faster initial response time (RT), which indicates that they afforded data reducing processes. RT at cluster boundary increased in parallel with the number of items forming the clusters, suggesting that subroutines of different length were responsible for the ordering of items within clusters of different size. Evidence for hierarchical coding was also obtained in a serial recognition task, indicating this type of representation pertains to the retention of the sequences rather than exclusively to the organisation of the motor plan for the reproduction of the sequences.","PeriodicalId":88321,"journal":{"name":"The European journal of cognitive psychology","volume":"43 1","pages":"216 - 246"},"PeriodicalIF":0.0000,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"Spatial clustering and hierarchical coding in immediate serial recall\",\"authors\":\"C. De Lillo, V. Lesk\",\"doi\":\"10.1080/09541440902757918\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Four experiments are reported that demonstrate the benefits of clustering by spatial proximity in spatial serial recall and provide support for the notion that hierarchical coding underpins the retention of clustered sequences in spatial working memory. Sequences segregated by spatial clusters increased serial recall performance at different levels of sequence length in a variation of the Corsi test and produced a faster initial response time (RT), which indicates that they afforded data reducing processes. RT at cluster boundary increased in parallel with the number of items forming the clusters, suggesting that subroutines of different length were responsible for the ordering of items within clusters of different size. Evidence for hierarchical coding was also obtained in a serial recognition task, indicating this type of representation pertains to the retention of the sequences rather than exclusively to the organisation of the motor plan for the reproduction of the sequences.\",\"PeriodicalId\":88321,\"journal\":{\"name\":\"The European journal of cognitive psychology\",\"volume\":\"43 1\",\"pages\":\"216 - 246\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The European journal of cognitive psychology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/09541440902757918\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The European journal of cognitive psychology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/09541440902757918","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18

摘要

四个实验证明了空间邻近聚类在空间序列回忆中的好处,并为层次编码支持聚类序列在空间工作记忆中的保留这一概念提供了支持。在不同序列长度的Corsi测试中,空间聚类分离序列提高了序列回忆性能,并产生了更快的初始响应时间(RT),这表明空间聚类分离序列提供了数据缩减过程。聚类边界RT随组成聚类的项目数量的增加而平行增加,表明不同长度的子程序负责不同大小的聚类内项目的排序。在序列识别任务中也获得了分层编码的证据,表明这种类型的表示与序列的保留有关,而不仅仅是序列复制的运动计划的组织。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Spatial clustering and hierarchical coding in immediate serial recall
Four experiments are reported that demonstrate the benefits of clustering by spatial proximity in spatial serial recall and provide support for the notion that hierarchical coding underpins the retention of clustered sequences in spatial working memory. Sequences segregated by spatial clusters increased serial recall performance at different levels of sequence length in a variation of the Corsi test and produced a faster initial response time (RT), which indicates that they afforded data reducing processes. RT at cluster boundary increased in parallel with the number of items forming the clusters, suggesting that subroutines of different length were responsible for the ordering of items within clusters of different size. Evidence for hierarchical coding was also obtained in a serial recognition task, indicating this type of representation pertains to the retention of the sequences rather than exclusively to the organisation of the motor plan for the reproduction of the sequences.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
What are the Bayesian constraints in the Bayesian reader? Reply to Norris and Kinoshita (2010) Explanation versus accommodation: Reply to Bowers (2010) Assessing changes in performance and monitoring processes in individual and collaborative tests according to students' metacognitive skills The contribution of familiarity to within- and between-domain associative recognition memory: Use of a modified remember/know procedure Does masked and unmasked priming reflect Bayesian inference as implemented in the Bayesian Reader?
×
引用
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