Statistical consistency and hypothesis testing for nonmetric multidimensional scaling

The properties of nonmetric multidimensional scaling (NMDS) are explored by specifying statistical models, proving statistical consistency, and developing hypothesis testing procedures. Statistical models with errors in the dependent and independent variables are described for quantitative and qualitative data. For these models, statistical consistency often depends crucially upon how error enters the model and how data are collected and summarized (e.g., by means, medians, or rank statistics). A maximum likelihood estimator for NMDS is developed, and its relationship to the standard Shepard-Kruskal estimation method is described. This maximum likelihood framework is used to develop a method for testing the overall fit of the model.     

Probabilistic multidimensional scaling: Complete and incomplete data

Simple procedures are described for obtaining maximum likelihood estimates of the location and uncertainty parameters of the Hefner model. This model is a probabilistic, multidimensional scaling model, which assigns a multivariate normal distribution to each stimulus point. It is shown that for such a model, standard nonmetric and metric algorithms are not appropriate. A procedure is also described for constructing incomplete data sets, by taking into consideration the degree of familiarity the subject has for each stimulus. Maximum likelihood estimates are developed both for complete and incomplete data sets. This research was supported by National Science Grant No. SOC76-20517. The first author would especially like to express his gratitude to the Netherlands Institute for Advanced Study for its very substantial help with this research.     

A stochastic multidimensional scaling procedure for the empirical determination of convex indifference curves for preference/choice analysis

The vast majority of existing multidimensional scaling (MDS) procedures devised for the analysis of paired comparison preference/choice judgments are typically based on either scalar product (i.e., vector) or unfolding (i.e., ideal-point) models. Such methods tend to ignore many of the essential components of microeconomic theory including convex indifference curves, constrained utility maximization, demand functions, et cetera. This paper presents a new stochastic MDS procedure called MICROSCALE that attempts to operationalize many of these traditional microeconomic concepts. First, we briefly review several existing MDS models that operate on paired comparisons data, noting the particular nature of the utility functions implied by each class of models. These utility assumptions are then directly contrasted to those of microeconomic theory. The new maximum likelihood based procedure, MICROSCALE, is presented, as well as the technical details of the estimation procedure. The results of a Monte Carlo analysis investigating the performance of the algorithm as a number of model, data, and error factors are experimentally manipulated are provided. Finally, an illustration in consumer psychology concerning a convenience sample of thirty consumers providing paired comparisons judgments for some fourteen brands of over-the-counter analgesics is discussed.     

Robust multidimensional scaling

A method for multidimensional scaling that is highly resistant to the effects of outliers is described. To illustrate the efficacy of the procedure, some Monte Carlo simulation results are presented. The method is shown to perform well when outliers are present, even in relatively large numbers, and also to perform comparably to other approaches when no outliers are present.This research was supported by Grant A8351 from the Natural Sciences and Engineering Research Council of Canada to Ian Spence.     

A new computational method to fit the weighted euclidean distance model

This paper describes a computational method for weighted euclidean distance scaling which combines aspects of an analytic solution with an approach using loss functions. We justify this new method by giving a simplified treatment of the algebraic properties of a transformed version of the weighted distance model. The new algorithm is much faster than INDSCAL yet less arbitrary than other analytic procedures. The procedure, which we call SUMSCAL (subjectivemetricscaling), gives essentially the same solutions as INDSCAL for two moderate-size data sets tested.Comments by J. Douglas Carroll and J. B. Kruskal have been very helpful in preparing this paper.     

Constrained multidimensional scaling inN spaces

A gradient method is used to obtain least squares estimates of parameters of them-dimensional euclidean model simultaneously inN spaces, given the observation of all pairwise distances ofn stimuli for each space. The procedure can estimate an additive constant as well as stimulus projections and the metric of the reference axes of the configuration in each space. Each parameter in the model can be fixed to equal some a priori value, constrained to be equal to any other parameter, or free to take on any value in the parameter space. Two applications of the procedure are described.     

A multidimensional scaling model for the size-weight illusion

The kinds of individual differences in perceptions permitted by the weighted euclidean model for multidimensional scaling (e.g., INDSCAL) are much more restricted than those allowed by Tucker's Three-mode Multidimensional Scaling (TMMDS) model or Carroll's Idiosyncratic Scaling (IDIOSCAL) model. Although, in some situations the more general models would seem desirable, investigators have been reluctant to use them because they are subject to transformational indeterminacies which complicate interpretation. In this article, we show how these indeterminacies can be removed by constructing specific models of the phenomenon under investigation. As an example of this approach, a model of the size-weight illusion is developed and applied to data from two experiments, with highly meaningful results. The same data are also analyzed using INDSCAL. Of the two solutions, only the one obtained by using the size-weight model allows examination of individual differences in the strength of the illusion; INDSCAL can not represent such differences. In this sample, however, individual differences in illusion strength turn out to be minor. Hence the INDSCAL solution, while less informative than the size-weight solution, is nonetheless easily interpretable.This paper is based on the first author's doctoral dissertation at the Department of Psychology, University of Illinois at Urbana-Champaign. The aid of Professor Ledyard R Tucker is gratefully acknowledged.     

Multidimensional successive categories scaling: A maximum likelihood method

A single-step maximum likelihood estimation procedure is developed for multidimensional scaling of dissimilarity data measured on rating scales. The procedure can fit the euclidian distance model to the data under various assumptions about category widths and under two distributional assumptions. The scoring algorithm for parameter estimation has been developed and implemented in the form of a computer program. Practical uses of the method are demonstrated with an emphasis on various advantages of the method as a statistical procedure.The research reported here was partly supported by Grant A6394 to the author by Natural Sciences and Engineering Research Council of Canada. Portions of this research were presented at the Psychometric Society meeting in Uppsala, Sweden, in June, 1978. MAXSCAL-2.1, a program to perform the computations discussed in this paper may be obtained from the author. Thanks are due to Jim Ramsay for his helpful comments.     

Restricted multidimensional scaling models for asymmetric proximities

Restricted multidimensional scaling models [Bentler & Weeks, 1978] allowing constraints on parameters, are extended to the case of asymmetric data. Separate functions are used to model the symmetric and antisymmetric parts of the data. The approach is also extended to the case in which data are presumed to be linearly related to squared distances. Examples of several models are provided, using journal citation data. Possible extensions of the models are considered. This research was supported in part by USPHS Grant 0A01070, P. M. Bentler, principal investigator, and NIMH Grant MH-24819, E. J. Anthony and J. Worland, principal investigators. The authors wish to thank E. W. Holman and several anonymous reviewers for their valuable suggestions concerning this research.     

A generalized majorization method for least souares multidimensional scaling of pseudodistances that may be negative

The usual convergence proof of the SMACOF algorithm model for least squares multidimensional scaling critically depends on the assumption of nonnegativity of the quantities to be fitted, called the pseudodistances. When this assumption is violated, erratic convergence behavior is known to occur. Three types of circumstances in which some of the pseudodistances may become negative are outlined: nonmetric multidimensional scaling with normalization on the variance, metric multidimensional scaling including an additive constant, and multidimensional scaling under the city-block distance model. A generalization of the SMACOF method is proposed to resolve the difficulty that is based on the same rationale frequently involved in robust fitting with least absolute residuals.I am grateful to Patrick Groenen and Rian van Blokland-Vogelesang for their help with some of the computations, and to the anonymous referees for their very useful comments.     

The tunneling method for global optimization in multidimensional scaling

This paper focuses on the problem of local minima of the STRESS function. It turns out that unidimensional scaling is particularly prone to local minima, whereas full dimensional scaling with Euclidean distances has a local minimum that is global. For intermediate dimensionality with Euclidean distances it depends on the dissimilarities how severe the local minimum problem is. For city-block distances in any dimensionality many different local minima are found. A simulation experiment is presented that indicates under what conditions local minima can be expected. We introduce the tunneling method for global minimization, and adjust it for multidimensional scaling with general Minkowski distances. The tunneling method alternates a local search step, in which a local minimum is sought, with a tunneling step in which a different configuration is sought with the same STRESS as the previous local minimum. In this manner successively better local minima are obtained, and experimentation so far shows that the last one is often a global minimum.This paper is based on the 1994 Psychometric Society's outstanding thesis award of the first author. The authros would like to thank Robert Tijssen of the CWTS Leiden for kindly making available the co-citation data of the Psychometric literature. This paper is an extended version of the paper presented at the Annual Meeting of the Psychometric Society at Champaign-Urbana, Illin., June 1994.     

A stochastic multidimensional unfolding approach for representing phased decision outcomes

This paper presents a stochastic multidimensional unfolding (MDU) procedure to spatially represent individual differences in phased or sequential decision processes. The specific application or scenario to be discussed involves the area of consumer psychology where consumers form judgments sequentially in their awareness, consideration, and choice set compositions in a phased or sequential manner as more information about the alternative brands in a designated product/service class are collected. A brief review of the consumer psychology literature on these nested congnitive sets as stages in phased decision making is provided. The technical details of the proposed model, maximum likelihood estimation framework, and algorithm are then discussed. A small scale Monte Carlo analysis is presented to demonstrate estimation proficiency and the appropriateness of the proposed model selection heuristic. An application of the methodology to capture awareness, consideration, and choice sets in graduate school applicants is presented. Finally, directions for future research and other potential applications are given.     

A model and algorithm for multidimensional scaling with external constraints on the distances

A method for externally constraining certain distances in multidimensional scaling configurations is introduced and illustrated. The approach defines an objective function which is a linear composite of the loss function of the point configurationX relative to the proximity dataP and the loss ofX relative to a pseudo-data matrixR. The matrixR is set up such that the side constraints to be imposed onX's distances are expressed by the relations amongR's numerical elements. One then uses a double-phase procedure with relative penalties on the loss components to generate a constrained solutionX. Various possibilities for constructing actual MDS algorithms are conceivable: the major classes are defined by the specification of metric or nonmetric loss for data and/or constraints, and by the various possibilities for partitioning the matricesP andR. Further generalizations are introduced by substitutingR by a set ofR matrices,R _i ,i=1, ...r, which opens the way for formulating overlapping constraints as, e.g., in patterns that are both row- and column-conditional at the same time.     

Confidence regions for multidimensional scaling analysis

Techniques are developed for surrounding each of the points in a multidimensional scaling solution with a region which will contain the population point with some level of confidence. Bayesian credibility regions are also discussed. A general theorem is proven which describes the asymptotic distribution of maximum likelihood estimates subject to identifiability constraints. This theorem is applied to a number of models to display asymptotic variance-covariance matrices for coordinate estimates under different rotational constraints. A technique is described for displaying Bayesian conditional credibility regions for any sample size.The research reported here was supported by grant number APA 320 to the author by the National Research Council of Canada.     

Distance stability analysis in multidimensional scaling using the jackknife method

Stability or sensitivity analysis is an important topic in data analysis that has received little attention in the application of multidimensional scaling (MDS), for which the only available approaches are given in terms of a coordinate‐based analytical jackknife methodology. Although in MDS the prime interest is in assessing the stability of the points in the configuration, this methodology may be influenced by imprecisions resulting from the inherently necessary Procrustes method. This paper proposes an analytical distance‐based jackknife procedure to study stability and cross‐validation in MDS in terms of the jackknife distances, which is not influenced by the Procrustes method. For each object, the corresponding jackknife estimated points are considered as naturally clustered points, and stability and cross‐validation are analysed in terms of the MDS distances arising from the jackknife procedure, on the basis of a weighted cluster‐MDS algorithm. A jackknife‐relevant configuration is also proposed for cross‐validation in terms of coordinates, in a cluster‐MDS framework.     

Sequential estimation in multidimensional scaling

The concept of sequential estimation is introduced in multidimensional scaling (MDS). The sequential estimation method developed in this paper refers to continually updating estimates of a configuration as new observations are added. This method has a number of advantages, such as a locally optimal design of the experiment can be easily constructed, and dynamic experimentation is made possible. Using artificial data, the performance of our sequential method is illustrated.We are indebted to anonymous reviewers for their suggestions. In addition, we thank Dr. Frank Critchley for his helpful comments on our Q/S algorithm.