In confirmatory factor analysis (CFA), model parameters are usually estimated by iteratively minimizing the Maximum Likelihood (ML) fit function. In optimal circumstances, the ML estimator yields the desirable statistical properties of asymptotic unbiasedness, efficiency, normality, and consistency. In practice, however, real-life data tend to be…

Although many textbooks on multivariate statistics discuss the common factor analysis model, few of these books mention the problem of factor score indeterminacy (FSI). Thus, many students and contemporary researchers are unaware of an important fact. Namely, for any common factor model with known (or estimated) model parameters, infinite sets of…

Identifies a general algorithm for orthogonal rotation and shows that when an algorithm parameter alpha is sufficiently large, the algorithm converges monotonically to a stationary point of the rotation criterion from any starting value. Introduces a modification that does not require a large alpha and discusses the use of this modification as a…

An iterative process is proposed for obtaining an orthogonal simple structure solution. At each iteration, a target matrix is constructed such that the relative contributions of the target majorize the original ones, factor by factor. The convergence of the procedure is proven, and the algorithm is illustrated. (SLD)

A class of oblique rotation procedures is proposed to rotate a pattern matrix so that it optimally resembles a matrix that has an exact simple pattern. It is demonstrated that the method can recover relatively complex simple structures where other simple structure rotation techniques fail. (SLD)

Most of the current 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 presented. (Author/TJH)

Enriching factor rotation algorithms with the capacity to conduct repeated searches from random starting points can make the tendency to converge to optima that are merely local a way to catch rotations of the input factors that might otherwise elude discovery. Use of the HYBALL computer program is discussed. (SLD)

A procedure is outlined showing how the axiom of local independence for latent structure models can be weakened. (CK)

Relations between maximum likelihood factor analysis and factor indeterminacy are discussed. (CK)

Issues related to the decision of the number of factors to retain in factor analyses are identified. Three widely used decision rules--the Kaiser-Guttman (eigenvalue greater than one), scree, and likelihood ratio tests--are investigated using simulated data. Recommendations for use are made. (Author/JKS)

The performance of four rules for determining the number of components (factors) to retain (Kaiser's eigenvalue greater than one, Cattell's scree, Bartlett's test, and Velicer's Map) was investigated across four systematically varied factors (sample size, number of variables, number of components, and component saturation). (Author/JKS)

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)

A new basic algorithm is discussed that may be used to do factor analysis by any of these three methods: (1) unweighted least squares, (2) generalized least squares, or (3) maximum likelihood. (CK)

Factorial modeling is justified as a method for analyzing correlations in support of causal inference. The method is illustrated and compared to path analysis, LISREL-type analysis, canonical correlation, and commonality analysis. Predictions of impacts of policy manipulations are demonstrated. (Author/CP)