A general solution of the weighted orthonormal procrustes problem

A general solution for weighted orthonormal Procrustes problem is offered in terms of the least squares criterion. For the two-demensional case. this solution always gives the global minimum; for the general case, an algorithm is proposed that must converge, although not necessarily to the global minimum. In general, the algorithm yields a solution for the problem of how to fit one matrix to another under the condition that the dimensions of the latter matrix first are allowed to be transformed orthonormally and then weighted differentially, which is the task encountered in fitting analogues of the IDIOSCAL and INDSCAL models to a set of configurations.The authors are grateful to the Editor and the anonymous reviewers for their helpful comments on an earlier draft of this paper.     

A simplification of a result by zellini on the maximal rank of symmetric three-way arrays

Zellini (1979, Theorem 3.1) has shown how to decompose an arbitrary symmetric matrix of ordern ×n as a linear combination of 1/2n(n+1) fixed rank one matrices, thus constructing an explicit tensor basis for the set of symmetricn ×n matrices. Zellini's decomposition is based on properties of persymmetric matrices. In the present paper, a simplified tensor basis is given, by showing that a symmetric matrix can also be decomposed in terms of 1/2n(n+1) fixed binary matrices of rank one. The decomposition implies that ann ×n ×p array consisting ofp symmetricn ×n slabs has maximal rank 1/2n(n+1). Likewise, an unconstrained INDSCAL (symmetric CANDECOMP/PARAFAC) decomposition of such an array will yield a perfect fit in 1/2n(n+1) dimensions. When the fitting only pertains to the off-diagonal elements of the symmetric matrices, as is the case in a version of PARAFAC where communalities are involved, the maximal number of dimensions can be further reduced to 1/2n(n–1). However, when the saliences in INDSCAL are constrained to be nonnegative, the tensor basis result does not apply. In fact, it is shown that in this case the number of dimensions needed can be as large asp, the number of matrices analyzed.     

Some clarifications of the CANDECOMP algorithm applied to INDSCAL

Carroll and Chang have claimed that CANDECOMP applied to symmetric matrices yields equivalent coordinate matrices, as needed for INDSCAL. Although this claim has appeared to be valid for all practical purposes, it has gone without a rigorous mathematical footing. The purpose of the present paper is to clarify CANDECOMP in this respect. It is shown that equivalent coordinate matrices are not granted at global minima when the symmetric matrices are not Gramian, or when these matrices are Gramian but the solution not globally optimal.Part of this research has been supported by The Netherlands Organization for Scientific Research (NWO), PSYCHON-grant (560-267-011).     

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.     

A latent class approach to fitting the weighted Euclidean model,clascal

A weighted Euclidean distance model for analyzing three-way proximity data is proposed that incorporates a latent class approach. In this latent class weighted Euclidean model, the contribution to the distance function between two stimuli is per dimension weighted identically by all subjects in the same latent class. This model removes the rotational invariance of the classical multidimensional scaling model retaining psychologically meaningful dimensions, and drastically reduces the number of parameters in the traditional INDSCAL model. The probability density function for the data of a subject is posited to be a finite mixture of spherical multivariate normal densities. The maximum likelihood function is optimized by means of an EM algorithm; a modified Fisher scoring method is used to update the parameters in the M-step. A model selection strategy is proposed and illustrated on both real and artificial data.The second author is supported as Bevoegdverklaard Navorser of the Belgian Nationaal Fonds voor Wetenschappelijk Onderzoek.     

Nonmetric individual differences multidimensional scaling: An alternating least squares method with optimal scaling features

A new procedure is discussed which fits either the weighted or simple Euclidian model to data that may (a) be defined at either the nominal, ordinal, interval or ratio levels of measurement; (b) have missing observations; (c) be symmetric or asymmetric; (d) be conditional or unconditional; (e) be replicated or unreplicated; and (f) be continuous or discrete. Various special cases of the procedure include the most commonly used individual differences multidimensional scaling models, the familiar nonmetric multidimensional scaling model, and several other previously undiscussed variants.The procedure optimizes the fit of the model directly to the data (not to scalar products determined from the data) by an alternating least squares procedure which is convergent, very quick, and relatively free from local minimum problems.The procedure is evaluated via both Monte Carlo and empirical data. It is found to be robust in the face of measurement error, capable of recovering the true underlying configuration in the Monte Carlo situation, and capable of obtaining structures equivalent to those obtained by other less general procedures in the empirical situation.This project was supported in part by Research Grant No. MH10006 and Research Grant No. MH26504, awarded by the National Institute of Mental Health, DHEW. We wish to thank Robert F. Baker, J. Douglas Carroll, Joseph Kruskal, and Amnon Rapoport for comments on an earlier draft of this paper. Portions of the research reported here were presented to the spring meeting of the Psychometric Society, 1975. ALSCAL, a program to perform the computations discussed in this paper, may be obtained from any of the authors.Jan de Leeuw is currently at Datatheorie, Central Rekeninstituut, Wassenaarseweg 80, Leiden, The Netherlands. Yoshio Takane can be reached at the Department of Psychology, University of Tokyo, Tokyo, Japan.     

Simple structure in component analysis techniques for mixtures of qualitative and quantitative variables

Several methods have been developed for the analysis of a mixture of qualitative and quantitative variables, and one, called PCAMIX, includes ordinary principal component analysis (PCA) and multiple correspondence analysis (MCA) as special cases. The present paper proposes several techniques for simple structure rotation of a PCAMIX solution based on the rotation of component scores and indicates how these can be viewed as generalizations of the simple structure methods for PCA. In addition, a recently developed technique for the analysis of mixtures of qualitative and quantitative variables, called INDOMIX, is shown to construct component scores (without rotational freedom) maximizing the quartimax criterion over all possible sets of component scores. A numerical example is used to illustrate the implication that when used for qualitative variables, INDOMIX provides axes that discriminate between the observation units better than do those generated from MCA.The Netherlands organization for scientific research (NWO) is gratefully acknowledged for funding this project. This research was conducted while the author was supported by a PSYCHON-grant (560-267-011) from this organization. The author is obliged to Jos ten Berge for his comments on an earlier version.