Supervised versus unsupervised categorization: Two sides of the same coin?

Supervised and unsupervised categorization have been studied in separate research traditions. A handful of studies have attempted to explore a possible convergence between the two. The present research builds on these studies, by comparing the unsupervised categorization results of Pothos et al. (submitted; 2008) with the results from two procedures of supervised categorization. In two experiments, we tested 375 participants with nine different stimulus sets, and examined the relation between ease of learning of a classification, memory for a classification, and spontaneous preference for a classification. After taking into account the role of the number of category labels (clusters) in supervised learning, we found the three variables to be closely associated with each other. Our results provide encouragement for researchers seeking unified theoretical explanations for supervised and unsupervised categorization, but raise a range of challenging theoretical questions

A nonspatial methodology for the analysis of two-way proximity data incorporating the distance-density hypothesis

This paper presents a nonspatial operationalization of the Krumhansl (1978, 1982) distancedensity model of similarity. This model assumes that the similarity between two objects i and j is a function of both the interpoint distance between i and j and the density of other stimulus points in the regions surrounding i and j . We review this conceptual model and associated empirical evidence for such a specification. A nonspatial, tree-fitting methodology is described which is sufficiently flexible to fit a number of competing hypotheses of similarity formation. A sequential, unconstrained minimization algorithm is technically presented together with various program options. Three applications are provided which demonstrate the flexibility of the methodology. Finally, extensions to spatial models, three-way analyses, and hybrid models are discussed.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/45746/1/11336_2005_Article_BF02295285.pd

Tscale: A new multidimensional scaling procedure based on tversky's contrast model

Tversky's contrast model of proximity was initially formulated to account for the observed violations of the metric axioms often found in empirical proximity data. This set-theoretic approach models the similarity/dissimilarity between any two stimuli as a linear (or ratio) combination of measures of the common and distinctive features of the two stimuli. This paper proposes a new spatial multidimensional scaling (MDS) procedure called TSCALE based on Tversky's linear contrast model for the analysis of generally asymmetric three-way, two-mode proximity data. We first review the basic structure of Tversky's conceptual contrast model. A brief discussion of alternative MDS procedures to accommodate asymmetric proximity data is also provided. The technical details of the TSCALE procedure are given, as well as the program options that allow for the estimation of a number of different model specifications. The nonlinear estimation framework is discussed, as are the results of a modest Monte Carlo analysis. Two consumer psychology applications are provided: one involving perceptions of fast-food restaurants and the other regarding perceptions of various competitive brands of cola soft-drinks. Finally, other applications and directions for future research are mentioned.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/45750/1/11336_2005_Article_BF02294658.pd

Exploring the set-theoretical structure of objects by additive trees

proximity, dissimilarity, Restle feature system, set-symmetric distance, contrast model, (imperfect) nesting, (imperfectly) linear array, chain, additive tree, path length, tree distance, (imperfectly) linear tree,