Common and distinctive features in stimulus similarity: A modified version of the contrast model

Featural representations of similarity data assume that people represent stimuli in terms of a set of discrete properties. In this article, we consider the differences in featural representations that arise from making four different assumptions about how similarity is measured. Three of these similarity models— the common features model, the distinctive features model, and Tversky’s seminal contrast model—have been considered previously. The other model is new and modifies the contrast model by assuming that each individual feature only ever acts as a common or distinctive feature. Each of the four models is tested on previously examined similarity data, relating to kinship terms, and on a new data set, relating to faces. In fitting the models, we have used the geometric complexity criterion to balance the competing demands of data-fit and model complexity. The results show that both common and distinctive features are important for stimulus representation, and we argue that the modified contrast model combines these two components in a more effective and interpretable way than Tversky’s original formulation.

[1]  P. Hofstaetter [Similarity]. , 2020, Psyche.

[2]  F. Restle A metric and an ordering on sets , 1959 .

[3]  Alfréd Rényi,et al.  Foundations of Probability , 1971 .

[4]  R. Shepard Representation of structure in similarity data: Problems and prospects , 1974 .

[5]  H. Akaike A new look at the statistical model identification , 1974 .

[6]  Moonja P. Kim,et al.  The Method of Sorting as a Data-Gathering Procedure in Multivariate Research. , 1975, Multivariate behavioral research.

[7]  J. Lackner,et al.  The Psychological Representation of Speech Sounds , 1975, The Quarterly journal of experimental psychology.

[8]  Robert J. Glushko,et al.  Pattern goodness and redundancy revisited: Multidimensional scaling and hierarchical clustering analyses , 1975 .

[9]  J. Carroll,et al.  Spatial, non-spatial and hybrid models for scaling , 1976 .

[10]  A. Tversky Features of Similarity , 1977 .

[11]  G. Schwarz Estimating the Dimension of a Model , 1978 .

[12]  Roger N. Shepard,et al.  Additive clustering: Representation of similarities as combinations of discrete overlapping properties. , 1979 .

[13]  P. Arabie,et al.  Mapclus: A mathematical programming approach to fitting the adclus model , 1980 .

[14]  R N Shepard,et al.  Multidimensional Scaling, Tree-Fitting, and Clustering , 1980, Science.

[15]  A. Tversky,et al.  Weighting common and distinctive features in perceptual and conceptual judgments , 1984, Cognitive Psychology.

[16]  J. W. Hutchinson,et al.  Nearest neighbor analysis of psychological spaces. , 1986 .

[17]  R. Nosofsky Attention, similarity, and the identification-categorization relationship. , 1986, Journal of experimental psychology. General.

[18]  R. Shepard,et al.  Toward a universal law of generalization for psychological science. , 1987, Science.

[19]  Amos Tversky,et al.  On the relation between common and distinctive feature models , 1987 .

[20]  Phipps Arabie,et al.  Three-way scaling and clustering. , 1987 .

[21]  B. Mirkin Additive clustering and qualitative factor analysis methods for similarity matrices , 1989 .

[22]  Differential weighting of common and distinctive components. , 1990, Journal of experimental psychology. General.

[23]  R. A. Brooks,et al.  Intelligence without Representation , 1991, Artif. Intell..

[24]  R. Shepard Integrality versus separability of stimulus dimensions: From an early convergence of evidence to a p , 1991 .

[25]  R. Nosofsky Similarity Scaling and Cognitive Process Models , 1992 .

[26]  L. Komatsu Recent views of conceptual structure , 1992 .

[27]  John K. Kruschke,et al.  Human Category Learning: Implications for Backpropagation Models , 1993 .

[28]  J. Carroll,et al.  An alternating combinatorial optimization approach to fitting the INDCLUS and generalized INDCLUS models , 1994 .

[29]  Joshua B. Tenenbaum,et al.  Learning the Structure of Similarity , 1995, NIPS.

[30]  F. Y. Edgeworth,et al.  The theory of statistics , 1996 .

[31]  Peter Green,et al.  Markov chain Monte Carlo in Practice , 1996 .

[32]  Jorma Rissanen,et al.  Fisher information and stochastic complexity , 1996, IEEE Trans. Inf. Theory.

[33]  L. Wasserman,et al.  Computing Bayes Factors by Combining Simulation and Asymptotic Approximations , 1997 .

[34]  I. J. Myung,et al.  Applying Occam’s razor in modeling cognition: A Bayesian approach , 1997 .

[35]  Vijay Balasubramanian,et al.  Statistical Inference, Occam's Razor, and Statistical Mechanics on the Space of Probability Distributions , 1996, Neural Computation.

[36]  L E Marks,et al.  Circle size and diameter tilt: A new look at integrality and separability , 1998, Perception & psychophysics.

[37]  Michael D. Lee,et al.  Neural Feature Abstraction from Judgments of Similarity , 1998, Neural Computation.

[38]  S. Pinker How the Mind Works , 1999, Philosophy after Darwin.

[39]  Robert A. Wilson,et al.  Book Reviews: The MIT Encyclopedia of the Cognitive Sciences , 2000, CL.

[40]  I. J. Myung,et al.  Counting probability distributions: Differential geometry and model selection , 2000, Proc. Natl. Acad. Sci. USA.

[41]  M. Lee On the Complexity of Additive Clustering Models. , 2001, Journal of mathematical psychology.

[42]  M. Lee,et al.  Clustering Using the Contrast Model , 2001 .

[43]  M. Lee Determining the Dimensionality of Multidimensional Scaling Representations for Cognitive Modeling. , 2001, Journal of mathematical psychology.

[44]  J. Tenenbaum,et al.  Generalization, similarity, and Bayesian inference. , 2001, The Behavioral and brain sciences.

[45]  Douglas L. T. Rohde,et al.  Methods for Binary Multidimensional Scaling , 2002, Neural Computation.

[46]  Michael D. Lee,et al.  Combining Dimensions and Features in Similarity-Based Representations , 2002, NIPS.

[47]  M. Lee,et al.  Extending the ALCOVE model of category learning to featural stimulus domains , 2002, Psychonomic bulletin & review.

[48]  Michael D. Lee Generating Additive Clustering Models with Minimal Stochastic Complexity , 2002, J. Classif..

[49]  I. J. Myung,et al.  Toward a method of selecting among computational models of cognition. , 2002, Psychological review.

[50]  M. Lee,et al.  Avoiding the dangers of averaging across subjects when using multidimensional scaling , 2003 .

[51]  D. Navarro Regarding the complexity of additive clustering models: Comment on Lee (2001) , 2003 .

[52]  Michael D. Lee,et al.  A Simple Method for Generating Additive Clustering Models with Limited Complexity , 2002, Machine Learning.