A general rotation criterion and its use in orthogonal rotation

Measures of test parsimony and factor parsimony are defined. Minimizing their weighted sum produces a general rotation criterion for either oblique or orthogonal rotation. The quartimax, varimax and equamax criteria are special cases of the expression. Two new criteria are developed. One of these, the parsimax criterion, apparently gives excellent results. It is argued that one of the most important factors bearing on the choice of a rotation criterion for a particular problem is the amount of information available on the number of factors that should be rotated. This research was supported by the National Research Council of Canada research grant 291-13 to Dr. G. A. Ferguson.     

Varisim: A new machine method for orthogonal rotation

The derivative of Kaiser's Varimax criterion, if set to zero, yields a set of equations which are quite similar to those obtained for a least-squares problem of the Procrustes type. This similarity suggested an iterative technique for orthogonal rotation, dubbed Varisim, which was programmed for the IBM 7094 in FORTRAN. An empirical comparison between Varimax and Varisim, which was based on a number of data sets taken from the literature yielded three major results so far: (i) Varisim is slower than Varimax, roughly by a factor of 3, (ii) Varisim yields factors which in general contribute more evenly to the common test variance than Varimax factors, and which (iii) line up more closely with oblique configurations obtained with Binormamin than Varimax factors.This paper is based on parts of a thesis submitted to the Graduate College of the University of Illinois in partial fulfillment of the requirements for a degree in Psychology. Some of its contents were read at the joint meeting of the Psychonomic and the Psychometric Society, Niagara Falls, Ontario, 1964. Most of the computer-bound work was carried out while the author was employed by the Statistical Service Unit, University of Illinois; it was written up while the author held a Postdoctoral Fellowship at the Psychometric Laboratory of the University of North Carolina. Although space limitations forbid more complete acknowledgments, I am bound to record my deep gratitude to my advisor, Prof. H. F. Kaiser.     

A monotonically convergent algorithm for orthogonal congruence rotation

Brokken has proposed a method for orthogonal rotation of one matrix such that its columns have a maximal sum of congruences with the columns of a target matrix. This method employs an algorithm for which convergence from every starting point is not guaranteed. In the present paper, an iterative majorization algorithm is proposed which is guaranteed to converge from every starting point. Specifically, it is proven that the function value converges monotonically, and that the difference between subsequent iterates converges to zero. In addition to the better convergence properties, another advantage of the present algorithm over Brokken's one is that it is easier to program. The algorithms are compared on 80 simulated data sets, and it turned out that the new algorithm performed well in all cases, whereas Brokken's algorithm failed in almost half the cases. The derivation of the algorithm is given in full detail because it involves a series of inequalities that can be of use to derive similar algorithms in different contexts.This research has been made possible by a fellowship from the Royal Netherlands Academy of Arts and Sciences to the first author. The authors are obliged to Willem J. Heiser and Jos M. F. ten Berge for useful comments on an earlier version of this paper.     

A simple graphical method for orthogonal rotation of axes

A simple method of making orthogonal rotations by projecting coordinates from one plot to another is presented. An easily constructed apparatus for rapid and accurate work is described in detail. By the technique proposed 12 to 15 rotations of pairs of axes involving 20 test variables can be completed per hour by a practiced technician.     

The varimax criterion for analytic rotation in factor analysis

An analytic criterion for rotation is defined. The scientific advantage of analytic criteria over subjective (graphical) rotational procedures is discussed. Carroll's criterion and the quartimax criterion are briefly reviewed; the varimax criterion is outlined in detail and contrasted both logically and numerically with the quartimax criterion. It is shown that thenormal varimax solution probably coincides closely to the application of the principle of simple structure. However, it is proposed that the ultimate criterion of a rotational procedure is factorial invariance, not simple structure—although the two notions appear to be highly related. The normal varimax criterion is shown to be a two-dimensional generalization of the classic Spearman case, i.e., it shows perfect factorial invariance for two pure clusters. An example is given of the invariance of a normal varimax solution for more than two factors. The oblique normal varimax criterion is stated. A computational outline for the orthogonal normal varimax is appended.Part of the material in this paper is from the writer's Ph.D. thesis. I am indebted to my committee, Professors F. T. Tyler, R. C. Tryon, and H. D. Carter, chairman, for many helpful suggestions and criticisms. Dr. John Caffrey suggested the namevarimax, and wrote the original IBM 602A computer program for this criterion.I am also indebted to the staff of the University of California Computer Center for help in programming the procedures described in the paper for their IBM 701 electronic computer. Since their installation is partially supported by a grant from the National Science Foundation, the assistance of this agency is acknowledged.     

A computer program to find the best-fitting orthogonal factors for a given hypothesis

A modification of the quartimax computation for factor rotation is described in which a hypothesized factor pattern is given to the machine along with the data. The machine uses the pattern to select the subset of variables to which it will attend when rotating in a given plane, in order to find an orthogonal solution which closely fits the hypothesis. The program also provides a measure of the goodness of this fit. The program can utilize pattern matrices that reflect only partial hypotheses as to the nature of the factors, as well as those that specify highly determined simple structure.     

Independent detectors for expansion and rotation, and for orthogonal components of deformation.

It is well known that optic flow--the smooth transformation of the retinal image experienced by a moving observer--contains valuable information about the three-dimensional layout of the environment. From psychophysical and neurophysiological experiments, specialised mechanisms responsive to components of optic flow (sometimes called complex motion) such as expansion and rotation have been inferred. However, it remains unclear (a) whether the visual system has mechanisms for processing the component of deformation and (b) whether there are multiple mechanisms that function independently from each other. Here, we investigate these issues using random-dot patterns and a forced-choice subthreshold summation technique. In experiment 1, we manipulated the size of a test region that was permitted to contain signal and found substantial spatial summation for signal components of translation, expansion, rotation, and deformation embedded in noise. In experiment 2, little or no summation was found for the superposition of orthogonal pairs of complex motion patterns (eg expansion and rotation), consistent with probability summation between pairs of independent detectors. Our results suggest that optic-flow components are detected by mechanisms that are specialised for particular patterns of complex motion.     

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.     

On the equivalence of two oblique congruence rotation methods,and orthogonal approximations

Tucker's method of oblique congruence rotation is shown to be equivalent to a procedure by Meredith. This implies that Monte Carlo studies on congruence by Nesselroade, Baltes and Labouvie and by Korth and Tucker are highly comparable. The problem of rotating two matrices orthogonally to maximal congruence has not yet been solved. An approximate solution to this problem can be derived from Tucker's method. Even better results can be obtained from a Procrustes rotation followed by rotation to simple structure.     

In defense of the community criterion: A reply

Studies in Philosophy and Education -