Jump to ContentJump to Main Navigation
Classification and Cognition$
Users without a subscription are not able to see the full content.

W. K. Estes

Print publication date: 1994

Print ISBN-13: 9780195073355

Published to Oxford Scholarship Online: January 2008

DOI: 10.1093/acprof:oso/9780195073355.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in OSO for personal use (for details see www.oxfordscholarship.com/page/privacy-policy).date: 16 July 2019

Categorization and memory processing

Categorization and memory processing

(p.90) 4. Categorization and memory processing
Classification and Cognition

W. K. Estes

Oxford University Press

The models for category learning discussed in the preceding chapters have been developed largely in conjunction with a standard experimental design in which a subject classifies category exemplars with feedback during a learning phase, often running to hundreds of trials, then tested for transfer to new stimulus patterns of various types. This chapter describes efforts to modify the standard design in ways that may enable informative analyses pertaining to concepts of interference and organization in memory. Topics discussed include concurrent categorizations, categorization with constraints on memory, and exemplar and network models.

Keywords:   category learning, categorization, response frequency data, reaction times, exemplar models, network models

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .