Nonmetric maximum likelihood multidimensional scaling from directional rankings of similarities

A maximum likelihood estimation procedure is developed for multidimensional scaling when (dis)similarity measures are taken by ranking procedures such as the method of conditional rank orders or the method of triadic combinations. The central feature of these procedures may be termed directionality of ranking processes. That is, rank orderings are performed in a prescribed order by successive first choices. Those data have conventionally been analyzed by Shepard-Kruskal type of nonmetric multidimensional scaling procedures. We propose, as a more appropriate alternative, a maximum likelihood method specifically designed for this type of data. A broader perspective on the present approach is given, which encompasses a wide variety of experimental methods for collecting dissimilarity data including pair comparison methods (such as the method of tetrads) and the pick-M method of similarities. An example is given to illustrate various advantages of nonmetric maximum likelihood multidimensional scaling as a statistical method. At the moment the approach is limited to the case of one-mode two-way proximity data, but could be extended in a relatively straightforward way to two-mode two-way, two-mode three-way or even three-mode three-way data, under the assumption of such models as INDSCAL or the two or three-way unfolding models.The first author's work was supported partly by the Natural Sciences and Engineering Research Council of Canada, grant number A6394. Portions of this research were done while the first author was at Bell Laboratories. MAXSCAL-4.1, a program to perform the computations described in this paper can be obtained by writing to: Computing Information Service, Attention: Ms. Carole Scheiderman, Bell Laboratories, 600 Mountain Ave., Murray Hill, N.J. 07974. Thanks are due to Yukio Inukai, who generously let us use his stimuli in our experiment, and to Jim Ramsay for his helpful comments on an earlier draft of this paper. Confidence regions in Figures 2 and 3 were drawn by the program written by Jim Ramsay. We are also indebted to anonymous reviewers for their suggestions.     

Three notes on ALSCAL

It is reported that (1) a new coordinate estimation routine is superior to that originally proposed for ALSCAL; (2) an oversight in the interval measurement level case has been found and corrected; and (3) a new initial configuration routine is superior to the original.     

Analysis of contingency tables by ideal point discriminant analysis

Cross-classified data are frequently encountered in behavioral and social science research. The loglinear model and dual scaling (correspondence analysis) are two representative methods of analyzing such data. An alternative method, based on ideal point discriminant analysis (DA), is proposed for analysis of contingency tables, which in a certain sense encompasses the two existing methods. A variety of interesting structures can be imposed on rows and columns of the tables through manipulations of predictor variables and/or as direct constraints on model parameters. This, along with maximum likelihood estimation of the model parameters, allows interesting model comparisons. This is illustrated by the analysis of several data sets.Presented as the Presidential Address to the Psychometric Society's Annual and European Meetings, June, 1987. Preparation of this paper was supported by grant A6394 from the Natural Sciences and Engineering Research Council of Canada. Thanks are due to Chikio Hayashi of University of the Air in Japan for providing the ISM data, and to Jim Ramsay and Ivo Molenaar for their helpful comments on an earlier draft of this paper.     

Principal component analysis with external information on both subjects and variables

A method for structural analysis of multivariate data is proposed that combines features of regression analysis and principal component analysis. In this method, the original data are first decomposed into several components according to external information. The components are then subjected to principal component analysis to explore structures within the components. It is shown that this requires the generalized singular value decomposition of a matrix with certain metric matrices. The numerical method based on the QR decomposition is described, which simplifies the computation considerably. The proposed method includes a number of interesting special cases, whose relations to existing methods are discussed. Examples are given to demonstrate practical uses of the method.The work reported in this paper was supported by grant A6394 from the Natural Sciences and Engineering Research Council of Canada to the first author. Thanks are due to Jim Ramsay, Haruo Yanai, Henk Kiers, and Shizuhiko Nishisato for their insightful comments on earlier versions of this paper. Jim Ramsay, in particular, suggested the use of the QR decomposition, which simplified the presentation of the paper considerably.     

The role of disgust propensity in blood-injection-injury phobia: comparisons between Asian Americans and Caucasian Americans

There is a growing body of evidence suggesting the potential role of disgust propensity in blood-injection-injury (BII) phobia. The current study examined associations between disgust propensity and BII phobia symptom severity in Caucasian Americans (n=310) and Asian Americans (n=223). Asian Americans typically scored higher than Caucasian Americans on the BII and disgust measures. The present study also examined the structural relations between gender, cultural background, disgust propensity, and BII phobia symptom severity. According to the structural equation model, disgust propensity was significantly related to levels of BII phobia symptom severity and fully mediated the relationships between BII phobia symptom severity and the demographic variables of gender and cultural background. The implications of the results for cultural refinements to our understanding of disgust propensity and BII phobia are discussed.     

CPCA: A program for principal component analysis with external information on subjects and variables

A program is described for principal component analysis with external information on subjects and variables. This method is calledconstrained principal component analysis (CPCA), in which regression analysis and principal component analysis are combined into a unified framework that allows a full exploration of data structures both within and outside known information on subjects and variables. Many existing methods are special cases of CPCA, and the program can be used for multivariate multiple regression, redundancy analysis, double redundancy analysis, dual scaling with external criteria, vector preference models, and GMANOVA (growth curve models).     

Choice model analysis of the “pick any/n” type of binary data

In the “pick any/n” method, subjects are asked to choose any number of items from a list of n items according to some criterion. This kind of data can be analyzed as a special case of either multiple-choice data or successive categories data where the number of response categories is limited to two. An item response model was proposed for the latter case, which is a combination of an unfolding model and a choice model. The marginal maximum-likelihood estimation method was developed for parameter estimation to avoid incidental parameters, and an expectation-maximization algorithm used for numerical optimization. Two examples of analysis are given to illustrate the proposed method, which we call MAXSC.     

A generalization of Takane's algorithm for dedicom

An algorithm is described for fitting the DEDICOM model for the analysis of asymmetric data matrices. This algorithm generalizes an algorithm suggested by Takane in that it uses a damping parameter in the iterative process. Takane's algorithm does not always converge monotonically. Based on the generalized algorithm, a modification of Takane's algorithm is suggested such that this modified algorithm converges monotonically. It is suggested to choose as starting configurations for the algorithm those configurations that yield closed-form solutions in some special cases. Finally, a sufficient condition is described for monotonic convergence of Takane's original algorithm.Financial Support by the Netherlands organization for scientific research (NWO) is gratefully acknowledged. The authors are obliged to Richard Harshman.