Expanding the search for a linear separability constraint on category learning

Authors:
Publisher website
Google Scholar
Abstract
Formal models of categorization make different predictions about the theoretical importance of linear separability. Prior research, most of which has failed to find support for a linear separability constraint on category learning, has been conducted using tasks that involve learning two categories with a small number of members. The present experiment used four categories with three or nine patterns per category that were either linearly separable or not linearly separable. With overall category structure equivalent across category types, the linearly separable categories were found to be easier to learn than the not linearly separable categories. An analysis of individual participants' data showed that there were more participants operating under a linear separability constraint when learning large categories than when learning small ones. Formal modeling showed that an exemplar model could not account for many of these data. These results are taken to support the existence of multiple processes in categorization.

This publication has 42 references indexed in Scilit: