.png){kind=icon}
.png){kind=icon}
Return
Familiarity and categorization processes in memory search
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cogpsych.2014.08.003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A fundamental distinction in tasks of memory search is whether items receive varied mappings (targets and distractors switch roles across trials) or consistent mappings (targets and distractors never switch roles). The type of mapping often produces markedly different performance patterns, but formal memory-based models that account quantitatively for detailed aspects of the results have not yet been developed and evaluated. Experiments were conducted to test a modern exemplar-retrieval model on its ability to account for memory-search performance involving a wide range of memory-set sizes in both varied-mapping (VM) and consistent-mapping (CM) probe-recognition tasks. The model formalized the idea that both familiarity-based and categorization-based processes operate. The model was required to fit detailed response-time (RT) distributions of individual, highly practiced subjects. A key manipulation involved the repetition of negative probes across trials. This manipulation produced a dramatic dissociation: False-alarm rates increased and correct-rejection RTs got longer in VM, but not in CM. The qualitative pattern of results and modeling analyses provided evidence for a strong form of categorization-based processing in CM, in which observers made use of the membership of negative probes in the new category to make old-new recognition decisions. (C) 2014 Elsevier Inc. All rights reserved.
Keywords:
Memory search
Old-new recognition
Categorization
Familiarity
Automatic processing
Response times
Exemplar model
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.