Search

A simple modification substantially simplifies the use of the gradient projection (GP) rotation algorithms of Jennrich (2001, 2002). These algorithms require subroutines to compute the value and gradient of any specific rotation criterion of interest. The gradient can be difficult to derive and program. It is shown that using numerical gradients gives almost precisely the same results as using exact gradients. The resulting algorithm is very easy to use because the only problem specific code required is that needed to define the rotation criterion. The computing time is increased when using numerical gradients, but it is still very modest for most purposes. While used extensively elsewhere, numerical derivatives seem to be under utilized in statistics.

The infinitesimal jackknife, a nonparametric method for estimating standard errors, has been used to obtain standard error estimates in covariance structure analysis. In this article, we adapt it for obtaining standard errors for rotated factor loadings and factor correlations in exploratory factor analysis with sample correlation matrices. Both maximum likelihood estimation and ordinary least squares estimation are considered. (Contains 2 tables and 1 figure.)

Bi-factor analysis is a form of confirmatory factor analysis originally introduced by Holzinger and Swineford ("Psychometrika" 47:41-54, 1937). The bi-factor model has a general factor, a number of group factors, and an explicit bi-factor structure. Jennrich and Bentler ("Psychometrika" 76:537-549, 2011) introduced an exploratory form of bi-factor analysis that does not require one to provide an explicit bi-factor structure a priori. They use exploratory factor analysis and a bifactor rotation criterion designed to produce a rotated loading matrix that has an approximate bi-factor structure. Among other things this can be used as an aid in finding an explicit bi-factor structure for use in a confirmatory bi-factor analysis. They considered only orthogonal rotation. The purpose of this paper is to consider oblique rotation and to compare it to orthogonal rotation. Because there are many more oblique rotations of an initial loading matrix than orthogonal rotations, one expects the oblique results to approximate a bi-factor structure better than orthogonal rotations and this is indeed the case. A surprising result arises when oblique bi-factor rotation methods are applied to ideal data.

Bi-factor analysis is a form of confirmatory factor analysis originally introduced by Holzinger. The bi-factor model has a general factor and a number of group factors. The purpose of this article is to introduce an exploratory form of bi-factor analysis. An advantage of using exploratory bi-factor analysis is that one need not provide a specific bi-factor model a priori. The result of an exploratory bi-factor analysis, however, can be used as an aid in defining a specific bi-factor model. Our exploratory bi-factor analysis is simply exploratory factor analysis using a bi-factor rotation criterion. This is a criterion designed to approximate perfect cluster structure in all but the first column of a rotated loading matrix. Examples are given to show how exploratory bi-factor analysis can be used with ideal and real data. The relation of exploratory bi-factor analysis to the Schmid-Leiman method is discussed. (Contains 1 table.)

The infinitesimal jackknife provides a simple general method for estimating standard errors in covariance structure analysis. Beyond its simplicity and generality what makes the infinitesimal jackknife method attractive is that essentially no assumptions are required to produce consistent standard error estimates, not even the requirement that the population sampled has the covariance structure assumed. Commonly used covariance structure analysis software uses parametric methods for estimating parameters and standard errors. When the population sampled has the covariance structure assumed, but fails to have the distributional form assumed, the parameter estimates usually remain consistent, but the standard error estimates do not. This has motivated the introduction of a variety of nonparametric standard error estimates that are consistent when the population sampled fails to have the distributional form assumed. The only distributional assumption these require is that the covariance structure be correctly specified. As noted, even this assumption is not required for the infinitesimal jackknife. The relation between the infinitesimal jackknife and other nonparametric standard error estimators is discussed. An advantage of the infinitesimal jackknife over the jackknife and the bootstrap is that it requires only one analysis to produce standard error estimates rather than one for every jackknife or bootstrap sample.

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.

Almost all modern rotation of factor loadings is based on optimizing a criterion, for example, the quartimax criterion for quartimax rotation. Recent advancements in numerical methods have led to general orthogonal and oblique algorithms for optimizing essentially any rotation criterion. All that is required for a specific application is a definition of the criterion and its gradient. The authors present the implementations of gradient projection algorithms, both orthogonal and oblique, as well as a catalogue of rotation criteria and corresponding gradients. Software for these is downloadable and free; a specific version is given for each of the computing environments used most by statisticians. Examples of rotation methods are presented by applying them to a loading matrix from Wehmeyer and Palmer.

A simple modification substantially simplifies the use of the gradient projection (GP) rotation algorithms of Jennrich (2001, 2002). These algorithms require subroutines to compute the value and gradient of any specific rotation criterion of interest. The gradient can be difficult to derive and program. It is shown that using numerical gradients gives almost precisely the same results as using exact gradients. The resulting algorithm is very easy to use because the only problem specific code required is that needed to define the rotation criterion. The computing time is increased when using numerical gradients, but it is still very modest for most purposes. While used extensively elsewhere, numerical derivatives seem to be underutilized in statistics.

Component loss functions (CLFs) are used to generalize the quartimax criterion for orthogonal rotation in factor analysis. These replace the fourth powers of the factor loadings by an arbitrary function of the second powers. Criteria of this form were introduced by a number of authors, primarily Katz and Rohlf (1974) and Rozeboom (1991), but there has been essentially no follow-up to this work. A method so simple, natural, and general deserves to be investigated more completely. A number of theoretical results are derived including the fact that any method using a concave CLF will recover perfect simple structure whenever it exists, and there are methods that will recover Thurstone simple structure whenever it exists. Specific CLFs are identified and it is shown how to compare these using standardized plots. Numerical examples are used to illustrate and compare CLF and other methods. Sorted absolute loading plots are introduced to aid in comparing results and setting parameters for methods that require them.

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 research tool. (SLD)

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.ahj.2004.09.031 Byline: Sidney C. Port (a)(b), Mark O. Goodarzi (c), Noel G. Boyle (d), Robert I. Jennrich (a) Abstract: The prognostic significance of blood glucose (BG) for nondiabetic patients in a stable chronic phase of cardiovascular disease (CVD) has been sparsely investigated, especially for glucose within the normal range. In particular, it is unknown if for these patients there is a graded relation of mortality to glucose or if there is a lower threshold. Author Affiliation: (a) Department of Statistics, University of California Los Angeles, Calif (b) Department of Mathematics, University of California Los Angeles, Calif (c) Division of Endocrinology, Diabetes, and Metabolism, Cedars-Sinai Medical Center and Department of Medicine, David Geffen School of Medicine at University of California Los Angeles, Calif (d) Division of Cardiology, Department of Medicine, David Geffen School of Medicine at University of California Los Angeles, Calif Article History: Received 5 May 2004; Accepted 20 September 2004