Orthogonal rotations to maximal agreement for two or more matrices of different column orders

Methods for orthogonal Procrustes rotation and orthogonal rotation to a maximal sum of inner products are examined for the case when the matrices involved have different numbers of columns. An inner product solution offered by Cliff is generalized to the case of more than two matrices. A nonrandom start for a Procrustes solution suggested by Green and Gower is shown to give better results than a random start. The Green-Gower Procrustes solution (with nonrandom start) is generalized to the case of more than two matrices. Simulation studies indicate that both the generalized inner product solution and the generalized Procrustes solution tend to attain their global optima within acceptable computation times. A simple procedure is offered for approximating simple structure for the rotated matrices without affecting either the Procrustes or the inner product criterion.The authors are obliged to Charles Lewis for helpful comments on a previous draft of this paper and to Frank Brokken for preparing a computer program that was used in this study.     

The simultaneous maximization of congruence for two or more matrices under orthogonal rotation

While a rotation procedure currently exists to maximize simultaneously Tucker's coefficient of congruence between corresponding factors of two factor matrices under orthogonal rotation of one factor matrix, only approximate solutions are known for the generalized case where two or more matrices are rotated. A generalization and modification of the existing rotation procedure to simultaneously maximize the congruence is described. An example using four data matrices, comparing the generalized congruence maximization procedure with alternative rotation procedures, is presented. The results show a marked improvement of the obtained congruence using the generalized congruence maximization procedure compared to other procedures, without a significant loss of success with respect to the least squares criterion. A computer program written by the author to perform the rotations is briefly discussed.     

探索性因素分析、目标旋转与因素结构的一致性

在因素结构水平上评估跨群体的一致性是在心理学研究中常常遇见的一个问题,对此问题的解答,可以选择探索性因素分析→目标旋转→一致性评估这一途径。本文首先介绍正交目标旋转的简单原理,然后介绍其在心理研究中的应用以及相关软件和程序。目标旋转之后,结构一致性的量化可以采用一致性系数等指标,这些指标可采用一定的实证分布、近似处理或经验标准进行统计检验。之后采用一项实证数据,演示探索性因素分析、目标旋转以及结构一致性的评估方法。     

Three-mode orthomax rotation

Factor analysis and principal components analysis (PCA) are often followed by an orthomax rotation to rotate a loading matrix to simple structure. The simple structure is usually defined in terms of the simplicity of the columns of the loading matrix. In Three-mode PCA, rotational freedom of the so called core (a three-way array relating components for the three different modes) can be used similarly to find a simple structure of the core. Simple structure of the core can be defined with respect to all three modes simultaneously, possibly with different emphases on the different modes. The present paper provides a fully flexible approach for orthomax rotation of the core to simple structure with respect to three modes simultaneously. Computationally, this approach relies on repeated (two-way) orthomax applied to supermatrices containing the frontal, lateral or horizontal slabs, respectively. The procedure is illustrated by means of a number of exemplary analyses. As a by-product, application of the Three-mode Orthomax procedures to two-way arrays is shown to reveal interesting relations with and interpretations of existing two-way simple structure rotation techniques.This research has been made possible by a fellowship from the Royal Netherlands Academy of Arts and Sciences to the author. The author is obliged to Jos ten Berge and two anonymous reviewers for useful comments on an earlier version of this paper.     

Orthogonal procrustes rotation for two or more matrices

Necessary and sufficient conditions for rotating matrices to maximal agreement in the least-squares sense are discussed. A theorem by Fischer and Roppert, which solves the case of two matrices, is given a more straightforward proof. A sufficient condition for a best least-squares fit for more than two matrices is formulated and shown to be not necessary. In addition, necessary conditions suggested by Kristof and Wingersky are shown to be not sufficient. A rotation procedure that is an alternative to the one by Kristof and Wingersky is presented. Upper bounds are derived for determining the extent to which the procedure falls short of attaining the best least-squares fit. The problem of scaling matrices to maximal agreement is discussed. Modifications of Gower's method of generalized Procrustes analysis are suggested.     

Standard errors for procrustes solutions

The asymptotic standard errors for the procrustes solutions are derived for orthogonal rotation, direct oblique rotation and indirect oblique rotation. The standard errors for the first two rotations are obtained using the augmented information matrices. For the indirect oblique solution, the standard errors of rotated parameters are derived from the information matrix of unrotated loadings using the chain rule for information matrices. For all three types of rotation, the standard errors of rotated parameters are presented for unstandardized and standardized manifest variables. Numerical examples show the similarity of theoretical and simulated values.     

Oblique Rotaton in Canonical Correlation Analysis Reformulated as Maximizing the Generalized Coefficient of Determination

To facilitate the interpretation of canonical correlation analysis (CCA) solutions, procedures have been proposed in which CCA solutions are orthogonally rotated to a simple structure. In this paper, we consider oblique rotation for CCA to provide solutions that are much easier to interpret, though only orthogonal rotation is allowed in the existing formulations of CCA. Our task is thus to reformulate CCA so that its solutions have the freedom of oblique rotation. Such a task can be achieved using Yanai’s (Jpn. J. Behaviormetrics 1:46–54, 1974; J. Jpn. Stat. Soc. 11:43–53, 1981) generalized coefficient of determination for the objective function to be maximized in CCA. The resulting solutions are proved to include the existing orthogonal ones as special cases and to be rotated obliquely without affecting the objective function value, where ten Berge’s (Psychometrika 48:519–523, 1983) theorems on suborthonormal matrices are used. A real data example demonstrates that the proposed oblique rotation can provide simple, easily interpreted CCA solutions.     

Control of social desirability in personality inventories: Principal-factor deletion

Rational and statistical techniques for controlling social desirability (SD) in scales derived from self-report inventories are reviewed. The principal-factor deletion technique is explained in detail. It is applied during factor analysis when derived content scales are expected to be tainted with SD. If one principal factor is found to represent social desirability, the implicated factor is dropped and the communalities adjusted before the remaining factors are rotated to a desired simple structure criterion. Subscales derived from resulting factors are free of SD bias. Principal-factor deletion is compared with other approaches including rational techniques, covariate procedures, and target rotation.     

Orthomax rotation and perfect simple structure

A loading matrix has perfect simple structure if each row has at most one nonzero element. It is shown that if there is an orthogonal rotation of an initial loading matrix that has perfect simple structure, then orthomax rotation with 0 1 of the initial loading matrix will produce the perfect simple structure. In particular, varimax and quartimax will produce rotations with perfect simple structure whenever they exist.     

The weighted oblimin rotation

Cureton & Mulaik (1975) proposed the Weighted Varimax rotation so that Varimax (Kaiser, 1958) could reach simple solutions when the complexities of the variables in the solution are larger than one. In the present paper the weighting procedure proposed by Cureton & Mulaik (1975) is applied to Direct Oblimin (Clarkson & Jennrich, 1988), and the rotation method obtained is called Weighted Oblimin. It has been tested on artificial complex data and real data, and the results seem to indicate that, even though Direct Oblimin rotation fails when applied to complex data, Weighted Oblimin gives good results if a variable with complexity one can be found for each factor in the pattern. Although the weighting procedure proposed by Cureton & Mulaik is based on Landahl's (1938) expression for orthogonal factors, Weighted Oblimin seems to be adequate even with highly oblique factors. The new rotation method was compared to other rotation methods based on the same weighting procedure and, whenever a variable with complexity one could be found for each factor in the pattern, Weighted Oblimin gave the best results. When rotating a simple empirical loading matrix, Weighted Oblimin seemed to slightly increase the performance of Direct Oblimin.The author is obliged to Henk A. L. Kiers and three anonymous reviewers for helpful comments on an earlier version of this paper.     

A cluster‐based factor rotation

A new oblique factor rotation method is proposed, the aim of which is to identify a simple and well‐clustered structure in a factor loading matrix. A criterion consisting of the complexity of a factor loading matrix and a between‐cluster dissimilarity is optimized using the gradient projection algorithm and the k‐means algorithm. It is shown that if there is an oblique rotation of an initial loading matrix that has a perfect simple structure, then the proposed method with Kaiser's normalization will produce the perfect simple structure. Although many rotation methods can also recover a perfect simple structure, they perform poorly when a perfect simple structure is not possible. In this case, the new method tends to perform better because it clusters the loadings without requiring the clusters to be perfect. Artificial and real data analyses demonstrate that the proposed method can give a simple structure, which the other methods cannot produce, and provides a more interpretable result than those of widely known rotation techniques.     

Generalized approaches to the maxbet problem and the maxdiff problem,with applications to canonical correlations

Van de Geer has reviewed various criteria for transforming two or more matrices to maximal agreement, subject to orthogonality constraints. The criteria have applications in the context of matching factor or configuration matrices and in the context of canonical correlation analysis for two or more matrices. The present paper summarizes and gives a unified treatment of fully general computational solutions for two of these criteria, Maxbet and Maxdiff. These solutions will be shown to encompass various well-known methods as special cases. It will be argued that the Maxdiff solution should be preferred to the Maxbet solution whenever the two criteria coincide. Horst's Maxcor method will be shown to lack the property of monotone convergence. Finally, simultaneous and successive versions of the Maxbet and Maxdiff solutions will be treated as special cases of a fully flexible approach where the columns of the rotation matrices are obtained in successive blocks.The author is obliged to Henk Kiers for computational assistance and helpful comments.     

A direct solution for pairwise rotations in Kaiser's varimax method

The present note contains a completing-the-squares type approach to the varimax rotation problem. This approach yields a direct proof of global optimality of a solution for optimal rotation in a plane. Because varimax rotation can be interpreted as diagonalization of a set of symmetric matrices, the present solution also applies to the diagonalization problem.The author is obliged to Jos M. F. ten Berge for helpful comments.     

Simplimax: Oblique rotation to an optimal target with simple structure

Factor analysis and principal component analysis are usually followed by simple structure rotations of the loadings. These rotations optimize a certain criterion (e.g., varimax, oblimin), designed to measure the degree of simple structure of the pattern matrix. Simple structure can be considered optimal if a (usually large) number of pattern elements is exactly zero. In the present paper, a class of oblique rotation procedures is proposed to rotate a pattern matrix such that it optimally resembles a matrix which has an exact simple pattern. It is demonstrated that this method can recover relatively complex simple structures where other well-known simple structure rotation techniques fail.This research has been made possible by a fellowship from the Royal Netherlands Academy of Arts and Sciences. The author is obliged to Jos ten Berge for helpful comments on an earlier version.     

Multidimensional rotation and scaling of configurations to optimal agreement

An integrated method for rotating and rescaling a set of configurations to optimal agreement in subspaces of varying dimensionalities is developed. The approach relates existing orthogonal rotation techniques as special cases within a general framework based on a partition of variation which provides convenient measures of agreement. In addition to the well-known Procrustes and inner product optimality criteria, a criterion which maximizes the consensus among subspaces of the configurations is suggested. Since agreement of subspaces of the configurations can be examined and compared, rotation and rescaling is extended from a data transformation technique to an analytical method.     

Riemannian Newton and trust-region algorithms for analytic rotation in exploratory factor analysis

In exploratory factor analysis, latent factors and factor loadings are seldom interpretable until analytic rotation is performed. Typically, the rotation problem is solved by numerically searching for an element in the manifold of orthogonal or oblique rotation matrices such that the rotated factor loadings minimize a pre-specified complexity function. The widely used gradient projection (GP) algorithm, although simple to program and able to deal with both orthogonal and oblique rotation, is found to suffer from slow convergence when the number of manifest variables and/or the number of latent factors is large. The present work examines the effectiveness of two Riemannian second-order algorithms, which respectively generalize the well-established truncated Newton and trust-region strategies for unconstrained optimization in Euclidean spaces, in solving the rotation problem. When approaching a local minimum, the second-order algorithms usually converge superlinearly or even quadratically, better than first-order algorithms that only converge linearly. It is further observed in Monte Carlo studies that, compared to the GP algorithm, the Riemannian truncated Newton and trust-region algorithms require not only much fewer iterations but also much less processing time to meet the same convergence criterion, especially in the case of oblique rotation.     

Oblique rotation in correspondence analysis: A step forward in the search for the simplest interpretation

Correspondence analysis (CA) is a popular method that can be used to analyse relationships between categorical variables. It is closely related to several popular multivariate analysis methods such as canonical correlation analysis and principal component analysis. Like principal component analysis, CA solutions can be rotated orthogonally as well as obliquely into a simple structure without affecting the total amount of explained inertia. However, some specific aspects of CA prevent standard rotation procedures from being applied in a straightforward fashion. In particular, the role played by weights assigned to points and dimensions and the duality of CA solutions are unique to CA. For orthogonal simple structure rotation, procedures recently have been proposed. In this paper, we construct oblique rotation methods for CA that take into account these specific difficulties. We illustrate the benefits of our oblique rotation procedure by means of two illustrative examples.     

A simple general method for oblique rotation

A simple and very general algorithm for oblique rotation is identified. While motivated by the rotation problem in factor analysis, it may be used to minimize almost any function of a not necessarily square matrix whose columns are restricted to have unit length. The algorithm has two steps. The first is to compute the gradient of the rotation criterion and the second is to project this onto a manifold of matrices with unit length columns. For this reason it is called a gradient projection algorithm. Because the projection step is very simple, implementation of the algorithm involves little more than computing the gradient of the rotation criterion which for many applications is very simple. It is proven that the algorithm is strictly monotone, that is as long as it is not already at a stationary point, each step will decrease the value of the criterion. Examples from a variety of areas are used to demonstrate the algorithm, including oblimin rotation, target rotation, simplimax rotation, and rotation to similarity and simplicity simultaneously. While it may be, the algorithm is not intended for use as a standard algorithm for well established problems, but rather as a tool for investigating new methods where its generality and simplicity may save an investigator substantial effort.The author would like to thank the review team for their insights and recommendations.     

Perception of three-dimensional angular rotation.

In three experiments, difference thresholds (dLs) and points of subjective equality (PSEs) for three-dimensional (3-D) rotation simulations were examined. In the first experiment, observers compared pairs of simulated spheres that rotated in polar projection and that differed in their structure (points plotted in the volume vs. on the surface), axis of rotation (vertical, y, vs. horizontal, x), and magnitude of rotation (20 degrees-70 degrees). DLs were lowest (7%) when points were on the surface and when at least one sphere rotated around the y-axis and varied with changes in the independent variables. PSEs were closest to objective equality when points were on the surface of both spheres and when both spheres rotated about the x-axis. In the second experiment, subjects provided direct estimates of the rotations of the same spheres. Results suggested a reasonable agreement between PSEs for the indirect-scaling and direct-estimate procedures. The third experiment varied sphere diameter (and therefore mean linear velocity of stimulus elements) and showed that although rotation judgments are biased by mean linear velocity, they are not likely to be made solely on the basis of that information. These and past results suggest a model whereby recovery of structure is conducted by low-level motion-detecting mechanisms, whereas rotation (and other) judgments are based on a higher level representation.