In many research domains different pieces of information are collected regarding the same set of objects. Each piece of information constitutes a data block, and all these (coupled) blocks have the object mode in common. When analyzing such data, an important aim is to obtain an overall picture of the structure underlying the whole set of coupled…

The use of Candecomp to fit scalar products in the context of INDSCAL is based on the assumption that the symmetry of the data matrices involved causes the component matrices to be equal when Candecomp converges. Ten Berge and Kiers gave examples where this assumption is violated for Gramian data matrices. These examples are believed to be local…

An iterative majorization algorithm is proposed for orthogonal congruence rotation that is guaranteed to converge from every starting point. In addition, the algorithm is easier to program than the algorithm proposed by F. B. Brokken, which is not guaranteed to converge. The derivation of the algorithm is traced in detail. (SLD)

Rowwise matrix correlation, based on the weighted sum of correlations between all pairs of corresponding rows of two proximity matrices, is discussed. Rowwise and columnwise indices are particularly suited for evaluating different types of conjectures of a similar pattern of entries across the two matrices. (SLD)

A method is proposed for comparison of distinct partitions of the same set of n objects through a simple cross-product index defined between corresponding entries from two proximity matrices providing particular a priori codings of the within-class and between-class relationships for the partitions. (SLD)

Monte Carlo procedures were used to investigate the properties of a nonmetric multidimensional scaling algorithm when used to scale an incomplete matrix of dissimilarities. Recommendations for users wishing to scale incomplete matrices are made. (Author/RC)

Five techniques that combine the ideals of rotation of matrices of factor loadings to optimal agreement and rotation to simple structure are compared on the basis of empirical and contrived data. Combining a generalized Procrustes analysis with Varimax on the main of the matched loading matrices performed well on all criteria. (SLD)

Four prominent oblique transformation techniques--promax, the Harris-Kaiser procedure, biquartimin, and direct oblimin--are examined and compared. Additionally, two newly developed procedures are presented and included in the comparisons. (Author/RC)

Presents a new approach for estimating missing observations together with the results of a Monte Carlo study of the relative strengths and weaknesses of this technique and three other available methods. These techniques are then examined with respect to their ability to use incomplete data to estimate the correlation matrix obtained using a full…

Applications to the Promax Rotation are discussed, and it is shown that these procedures solve Thurstone's hitherto intractable "invariant" box problem as well as other more common problems based on real data. (Author/RC)

Six major problems confronting attempts to use nonmetric multidimensional scaling to represent structures underlying similarity data are identified and the author's prospects for over-coming each of these problems are presented. (RC)