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.     

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.     

Factorial rotation to simple structure and maximum similarity

When the regression of factored variates on variates defining subpopulations (or experimental groups) is (a) nonlinear or (b) heteroscedastic, an existing solution to the problem of factorial invariance does not apply. This paper presents an approach which can be used in place of the existing solution and derives a method for obtaining maximally similar orthogonal simple structure factor pattern matrices across subpopulations. The method is applied to data from three experimental groups.The writer wishes to express his gratitude to Professor Paul Horst for his many helpful suggestions in the development presented here. Credit is also due to William Meredith and Michael Browne for their helpful comments. The study was supported in part by Office of Naval Research Contract Nonr-477(33) and USPHS Research Grant MH00743-08 (Principal Investigator: Paul Horst).     

A semi-analytical method of factorial rotation to simple structure

A factorial rotational method is presented which represents a compromise between the use of subjective judgment characteristic of graphical methods and the routine application of analytical methods. At present the analytical methods seem to be inadequate for the discovery of a simple structure, while graphical methods require more subjective judgment. The method herein presented locates the axes for subgroups of tests by an analytical method. The judgments used in the selection of subgroups are based on graphic data concerning interrelation of the factors.     

Rotation to Simple Loadings Using Component Loss Functions: The Oblique Case

Component loss functions (CLFs) similar to those used in orthogonal rotation are introduced to define criteria for oblique rotation in factor analysis. It is shown how the shape of the CLF affects the performance of the criterion it defines. For example, it is shown that monotone concave CLFs give criteria that are minimized by loadings with perfect simple structure when such loadings exist. Moreover, if the CLFs are strictly concave, minimizing must produce perfect simple structure whenever it exists. Examples show that methods defined by concave CLFs perform well much more generally. While it appears important to use a concave CLF, the specific CLF used is less important. For example, the very simple linear CLF gives a rotation method that can easily outperform the most popular oblique rotation methods promax and quartimin and is competitive with the more complex simplimax and geomin methods. The author would like to thank the editor and three reviewers for helpful suggestions and for identifying numerous errors.     

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.     

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.     

Penalized optimal scaling for ordinal variables with an application to international classification of functioning core sets

Ordinal data occur frequently in the social sciences. When applying principal component analysis (PCA), however, those data are often treated as numeric, implying linear relationships between the variables at hand; alternatively, non-linear PCA is applied where the obtained quantifications are sometimes hard to interpret. Non-linear PCA for categorical data, also called optimal scoring/scaling, constructs new variables by assigning numerical values to categories such that the proportion of variance in those new variables that is explained by a predefined number of principal components (PCs) is maximized. We propose a penalized version of non-linear PCA for ordinal variables that is a smoothed intermediate between standard PCA on category labels and non-linear PCA as used so far. The new approach is by no means limited to monotonic effects and offers both better interpretability of the non-linear transformation of the category labels and better performance on validation data than unpenalized non-linear PCA and/or standard linear PCA. In particular, an application of penalized optimal scaling to ordinal data as given with the International Classification of Functioning, Disability and Health (ICF) is provided.     

A simple Gauss-Newton procedure for covariance structure analysis with high-level computer languages

An implementation of the Gauss-Newton algorithm for the analysis of covariance structures that is specifically adapted for high-level computer languages is reviewed. With this procedure one need only describe the structural form of the population covariance matrix, and provide a sample covariance matrix and initial values for the parameters. The gradient and approximate Hessian, which vary from model to model, are computed numerically. Using this approach, the entire method can be operationalized in a comparatively small program. A large class of models can be estimated, including many that utilize functional relationships among the parameters that are not possible in most available computer programs. Some examples are provided to illustrate how the algorithm can be used.We are grateful to M. W. Browne and S. H. C. du Toit for many invaluable discussions about these computing ideas. Thanks also to Scott Chaiken for providing the data in the first example. They were collected as part of the U.S. Air Force's Learning Ability Measurement Project (LAMP), sponsored by the Air Force Office of Scientific Research (AFOSR) and the Human Resource Directorate of the Armstrong Laboratory (AL/HRM).     

Quartic rotation criteria and algorithms

Most of the currently used analytic rotation criteria for simple structure in factor analysis are summarized and identified as members of a general symmetric family of quartic criteria. A unified development of algorithms for orthogonal and direct oblique rotation using arbitrary criteria from this family is given. These algorithms represent fairly straightforward extensions of present methodology, and appear to be the best methods currently available.The research done by R. I. Jennrich was supported by NSF Grant MCS-8301587.     

Homogeneity analysis withk sets of variables: An alternating least squares method with optimal scaling features

Homogeneity analysis, or multiple correspondence analysis, is usually applied tok separate variables. In this paper we apply it to sets of variables by using sums within sets. The resulting technique is called OVERALS. It uses the notion of optimal scaling, with transformations that can be multiple or single. The single transformations consist of three types: nominal, ordinal, and numerical. The corresponding OVERALS computer program minimizes a least squares loss function by using an alternating least squares algorithm. Many existing linear and nonlinear multivariate analysis techniques are shown to be special cases of OVERALS. An application to data from an epidemiological survey is presented.This research was partly supported by SWOV (Institute for Road Safety Research) in Leidschendam, The Netherlands.     

Oblique factors and components with independent clusters

Relationships between the results of factor analysis and component analysis are derived when oblique factors have independent clusters with equal variances of unique factors. The factor loadings are analytically shown to be smaller than the corresponding component loadings while the factor correlations are shown to be greater than the corresponding component correlations. The condition for the inequality of the factor/component contributions is derived in the case with different variances for unique factors. Further, the asymptotic standard errors of parameter estimates are obtained for a simplified model with the assumption of multivariate normality, which shows that the component loading estimate is more stable than the corresponding factor loading estimate.     

The principal components of mixed measurement level multivariate data: An alternating least squares method with optimal scaling features

A method is discussed which extends principal components analysis to the situation where the variables may be measured at a variety of scale levels (nominal, ordinal or interval), and where they may be either continuous or discrete. There are no restrictions on the mix of measurement characteristics and there may be any pattern of missing observations. The method scales the observations on each variable within the restrictions imposed by the variable's measurement characteristics, so that the deviation from the principal components model for a specified number of components is minimized in the least squares sense. An alternating least squares algorithm is discussed. An illustrative example is given.Copies of this paper and of the associated PRINCIPALS program may be obtained by writing to Forrest W. Young, Psychometric Laboratory, Davie Hall 013-A, Chapel Hill, NC 27514.     

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.     

Additive structure in qualitative data: An alternating least squares method with optimal scaling features

A method is developed to investigate the additive structure of data that (a) may be measured at the nominal, ordinal or cardinal levels, (b) may be obtained from either a discrete or continuous source, (c) may have known degrees of imprecision, or (d) may be obtained in unbalanced designs. The method also permits experimental variables to be measured at the ordinal level. It is shown that the method is convergent, and includes several previously proposed methods as special cases. Both Monte Carlo and empirical evaluations indicate that the method is robust.This research was supported in part by grant MH-10006 from the National Institute of Mental Health to the Psychometric Laboratory of the University of North Carolina. We wish to thank Thomas S. Wallsten for comments on an earlier draft of this paper. Copies of the paper and of ADDALS, a program to perform the analyses discussed herein, may be obtained from the second author.     

In Spite of Indeterminacy Many Common Factor Score Estimates Yield an Identical Reproduced Covariance Matrix

It was investigated whether commonly used factor score estimates lead to the same reproduced covariance matrix of observed variables. This was achieved by means of Schönemann and Steiger’s (1976) regression component analysis, since it is possible to compute the reproduced covariance matrices of the regression components corresponding to different factor score estimates. It was shown that Thurstone’s, Ledermann’s, Bartlett’s, Anderson-Rubin’s, McDonald’s, Krijnen, Wansbeek, and Ten Berge’s, as well as Takeuchi, Yanai, and Mukherjee’s score estimates reproduce the same covariance matrix. In contrast, Harman’s ideal variables score estimates lead to a different reproduced covariance matrix.     

Model specification search using a genetic algorithm with factor reordering for a simple structure factor analysis model

Abstract:  Many techniques for automated model specification search based on numerical indices have been proposed, but no single decisive method has yet been determined. In the present article, the performance and features of the model specification search method using a genetic algorithm (GA) were verified. A GA is a robust and simple metaheuristic algorithm with great searching power. While there has already been some research applying metaheuristics to the model fitting task, we focus here on the search for a simple structure factor analysis model and propose a customized algorithm for dealing with certain problems specific to that situation. First, implementation of model specification search using a GA with factor reordering for a simple structure factor analysis is proposed. Then, through a simulation study using generated data with a known true structure and through example analysis using real data, the effectiveness and applicability of the proposed method were demonstrated.