A study of algorithms for covariance structure analysis with specific comparisons using factor analysis

Several algorithms for covariance structure analysis are considered in addition to the Fletcher-Powell algorithm. These include the Gauss-Newton, Newton-Raphson, Fisher Scoring, and Fletcher-Reeves algorithms. Two methods of estimation are considered, maximum likelihood and weighted least squares. It is shown that the Gauss-Newton algorithm which in standard form produces weighted least squares estimates can, in iteratively reweighted form, produce maximum likelihood estimates as well. Previously unavailable standard error estimates to be used in conjunction with the Fletcher-Reeves algorithm are derived. Finally all the algorithms are applied to a number of maximum likelihood and weighted least squares factor analysis problems to compare the estimates and the standard errors produced. The algorithms appear to give satisfactory estimates but there are serious discrepancies in the standard errors. Because it is robust to poor starting values, converges rapidly and conveniently produces consistent standard errors for both maximum likelihood and weighted least squares problems, the Gauss-Newton algorithm represents an attractive alternative for at least some covariance structure analyses.Work by the first author has been supported in part by Grant No. Da01070 from the U. S. Public Health Service. Work by the second author has been supported in part by Grant No. MCS 77-02121 from the National Science Foundation.     

A gauss-newton algorithm for exploratory factor analysis

It is shown that the scoring algorithm for maximum likelihood estimation in exploratory factor analysis can be developed in a way that is many times more efficient than a direct development based on information matrices and score vectors. The algorithm offers a simple alternative to current algorithms and when used in one-step mode provides the simplest and fastest method presently available for moving from consistent to efficient estimates. Perhaps of greater importance is its potential for extension to the confirmatory model. The algorithm is developed as a Gauss-Newton algorithm to facilitate its application to generalized least squares and to maximum likelihood estimation.This research was supported by NSF Grant MCS-8301587.     

A PROC MATRIX program for preference-dissimilarity multidimensional scaling

A computer program can be a means of communicating the structure of an algorithm as well as a tool for data analysis. From this perspective high-level matrix-oriented languages like PROC MATRIX in the SAS system are especially useful because of their readability and compactness. An algorithm for the joint analysis of dissimilarity and preference data using maximum likelihood estimation is presented in PROC MATRIX code.This research was supported by Grant APA 3020 from the Natural Sciences and Engineering Research Council of Canada.     

An extension of the rating scale model with an application to the measurement of change

The polytomous unidimensional Rasch model with equidistant scoring, also known as the rating scale model, is extended in such a way that the item parameters are linearly decomposed into certain basic parameters. The extended model is denoted as the linear rating scale model (LRSM). A conditional maximum likelihood estimation procedure and a likelihood-ratio test of hypotheses within the framework of the LRSM are presented. Since the LRSM is a generalization of both the dichotomous Rasch model and the rating scale model, the present algorithm is suited for conditional maximum likelihood estimation in these submodels as well. The practicality of the conditional method is demonstrated by means of a dichotomous Rasch example with 100 items, of a rating scale example with 30 items and 5 categories, and in the light of an empirical application to the measurement of treatment effects in a clinical study.Work supported in part by the Fonds zur Förderung der Wissenschaftlichen Forschung under Grant No. P6414.     

Standard errors for rotated factor loadings

Beginning with the results of Girshick on the asymptotic distribution of principal component loadings and those of Lawley on the distribution of unrotated maximum likelihood factor loadings, the asymptotic distribution of the corresponding analytically rotated loadings is obtained. The principal difficulty is the fact that the transformation matrix which produces the rotation is usually itself a function of the data. The approach is to use implicit differentiation to find the partial derivatives of an arbitrary orthogonal rotation algorithm. Specific details are given for the orthomax algorithms and an example involving maximum likelihood estimation and varimax rotation is presented.This research was supported in part by NIH Grant RR-3. The authors are grateful to Dorothy T. Thayer who implemented the algorithms discussed here as well as those of Lawley and Maxwell. We are particularly indebted to Michael Browne for convincing us of the significance of this work and for helping to guide its development and to Harry H. Harman who many years ago pointed out the need for standard errors of estimate.     

Inferring the structure of latent class

Present optimization techniques in latent class analysis apply the expectation maximization algorithm or the Newton-Raphson algorithm for optimizing the parameter values of a prespecified model. These techniques can be used to find maximum likelihood estimates of the parameters, given the specified structure of the model, which is defined by the number of classes and, possibly, fixation and equality constraints. The model structure is usually chosen on theoretical grounds. A large variety of structurally different latent class models can be compared using goodness-of-fit indices of the chi-square family, Akaike’s information criterion, the Bayesian information criterion, and various other statistics. However, finding the optimal structure for a given goodness-of-fit index often requires a lengthy search in which all kinds of model structures are tested. Moreover, solutions may depend on the choice of initial values for the parameters. This article presents a new method by which one can simultaneously infer the model structure from the data and optimize the parameter values. The method consists of a genetic algorithm in which any goodness-of-fit index can be used as a fitness criterion. In a number of test cases in which data sets from the literature were used, it is shown that this method provides models that fit equally well as or better than the models suggested in the original articles.     

Statistical methods for absorbing Markov-chain models for learning: Estimation and identification

General algorithms for computing the likelihood of any sequence generated by an absorbing Markov-chain are described. These algorithms enable an investigator to compute maximum likelihood estimates of parameters using unconstrained optimization techniques. The problem of parameter identifiability is reformulated into questions concerning the behavior of the likelihood function in the neighborhood of an extremum. An alternative characterization of the concept of identifiability is proposed. A procedure is developed for deciding whether or not this definition is satisfied.This research was undertaken within the Institute for the Study of Intellectual Behavior, University of Colorado, and is Publication No. 42 of the Institute. The work was supported by NSF Grant GB-34077X. The logic underlying Algorithm I was suggested by Clint Schumacher.     

Maximum likelihood estimation of polyserial correlations

This paper considers a multivariate normal model with one of the component variables observable only in polytomous form. The maximum likelihood approach is used for estimation of the parameters in the model. The Newton-Raphson algorithm is implemented to obtain the solution of the problem. Examples based on real and simulated data are reported.The research of the first author was supported in part by a research grant (DA01070) from the US Public Health Service. We are indebted to the referees and the editor for some very valuable comments and suggestions.     

Fitting a response model forn dichotomously scored items

A method of estimating the parameters of the normal ogive model for dichotomously scored item-responses by maximum likelihood is demonstrated. Although the procedure requires numerical integration in order to evaluate the likelihood equations, a computer implemented Newton-Raphson solution is shown to be straightforward in other respects. Empirical tests of the procedure show that the resulting estimates are very similar to those based on a conventional analysis of item difficulties and first factor loadings obtained from the matrix of tetrachoric correlation coefficients. Problems of testing the fit of the model, and of obtaining invariant parameters are discussed.Research reported in this paper was supported by NSF Grant 1025 to the University of Chicago.     

Probabilistic multidimensional scaling: Complete and incomplete data

Simple procedures are described for obtaining maximum likelihood estimates of the location and uncertainty parameters of the Hefner model. This model is a probabilistic, multidimensional scaling model, which assigns a multivariate normal distribution to each stimulus point. It is shown that for such a model, standard nonmetric and metric algorithms are not appropriate. A procedure is also described for constructing incomplete data sets, by taking into consideration the degree of familiarity the subject has for each stimulus. Maximum likelihood estimates are developed both for complete and incomplete data sets. This research was supported by National Science Grant No. SOC76-20517. The first author would especially like to express his gratitude to the Netherlands Institute for Advanced Study for its very substantial help with this research.     

Maximum likelihood estimation of multivariate polyserial and polychoric correlation coefficients

The method of finding the maximum likelihood estimates of the parameters in a multivariate normal model with some of the component variables observable only in polytomous form is developed. The main stratagem used is a reparameterization which converts the corresponding log likelihood function to an easily handled one. The maximum likelihood estimates are found by a Fletcher-Powell algorithm, and their standard error estimates are obtained from the information matrix. When the dimension of the random vector observable only in polytomous form is large, obtaining the maximum likelihood estimates is computationally rather labor expensive. Therefore, a more efficient method, the partition maximum likelihood method, is proposed. These estimation methods are demonstrated by real and simulated data, and are compared by means of a simulation study.     

Standard errors for obliquely rotated factor loadings

In a manner similar to that used in the orthogonal case, formulas for the aymptotic standard errors of analytically rotated oblique factor loading estimates are obtained. This is done by finding expressions for the partial derivatives of an oblique rotation algorithm and using previously derived results for unrotated loadings. These include the results of Lawley for maximum likelihood factor analysis and those of Girshick for principal components analysis. Details are given in cases including direct oblimin and direct Crawford-Ferguson rotation. Numerical results for an example involving maximum likelihood estimation with direct quartimin rotation are presented. They include simultaneous tests for significant loading estimates.This research was supported in part by NIH Grant RR-3. The author is indebted to Dorothy Thayer who implemented the algorithms required for the example and to Gunnar Gruvaeus and Allen Yates for reviewing an earlier version of this paper. Special thanks are extended to Michael Browne for many conversations devoted to clarifying the thoughts of the author.     

An EM algorithm for fitting two-level structural equation models

Maximum likelihood is an important approach to analysis of two-level structural equation models. Different algorithms for this purpose have been available in the literature. In this paper, we present a new formulation of two-level structural equation models and develop an EM algorithm for fitting this formulation. This new formulation covers a variety of two-level structural equation models. As a result, the proposed EM algorithm is widely applicable in practice. A practical example illustrates the performance of the EM algorithm and the maximum likelihood statistic.We are thankful to the reviewers for their constructive comments that have led to significant improvement on the first version of this paper. Special thanks are due to the reviewer who suggested a comparison with the LISREL program in the saturated means model, and provided its setup and output. This work was supported by National Institute on Drug Abuse grants DA01070, DA00017, and a UNH 2002 Summer Faculty Fellowship.     

The effect of number of categories in rating scales on precision of estimation of scale values

The precision of scale value estimates using maximum likelihood estimation is examined for varying numbers of categories, varying discriminal dispersions and with and without category boundary estimation. It is concluded that this type of estimation is somewhat unsatisfactory if boundaries are estimated unless these are of specific interest. If they are not estimated, it is concluded that using seven or more categories provides very nearly as much precision of estimate as a corresponding continuous judgment task.This research was supported by National Research Council of Canada Grant A0320 to the author.     

Bayesian estimation in the two-parameter logistic model

A Bayesian procedure is developed for the estimation of parameters in the two-parameter logistic item response model. Joint modal estimates of the parameters are obtained and procedures for the specification of prior information are described. Through simulation studies it is shown that Bayesian estimates of the parameters are superior to maximum likelihood estimates in the sense that they are (a) more meaningful since they do not drift out of range, and (b) more accurate in that they result in smaller mean squared differences between estimates and true values.The research reported here was performed pursuant to Grant No. N0014-79-C-0039 with the Office of Naval Research.     

Influence analysis of ranking data

This paper develops diagnostic measures to identify those observations in Thurstonian models for ranking data which unduly influence parameter estimates that are obtained by the partition maximum likelihood approach of Chan and Bentler (1998). Diagnostic measures are constructed by employing the local influence approach that uses geometric techniques to assess the effect of small perturbations on a postulated statistical model. Very little additional effort is required to compute the proposed diagnostic measures, because all of the necessary building blocks are readily available after a usual fit of the model. The work described in this paper was partially supported by the grants from the Research Grants Council of the Hong Kong Special Administrative Region, China (RGC Ref. No. CUHK4186/98P and RGC Direct Grant ID2060178). The authors are grateful to the Editor and four anonymous referees for their helpful comments.     

Constrained maximum likelihood estimation of two-level covariance structure model via EM type algorithms

In this paper, the constrained maximum likelihood estimation of a two-level covariance structure model with unbalanced designs is considered. The two-level model is reformulated as a single-level model by treating the group level latent random vectors as hypothetical missing-data. Then, the popular EM algorithm is extended to obtain the constrained maximum likelihood estimates. For general nonlinear constraints, the multiplier method is used at theM-step to find the constrained minimum of the conditional expectation. An accelerated EM gradient procedure is derived to handle linear constraints. The empirical performance of the proposed EM type algorithms is illustrated by some artifical and real examples.This research was supported by a Hong Kong UCG Earmarked Grant, CUHK 4026/97H. We are greatly indebted to D.E. Morisky and J.A. Stein for the use of their AIDS data in our example. We also thank the Editor, two anonymous reviewers, W.Y. Poon and H.T. Zhu for constructive suggestions and comments in improving the paper. The assistance of Michael K.H. Leung and Esther L.S. Tam is gratefully acknowledged.     

A note on the computation of the second-order derivatives of the elementary symmetric functions in the rasch model

Jansen (1984) gave explicit formulas for the computation of the second-order derivatives of the elementary symmetric functions. But they are only applicable to those pairs of items which have unequal parameters. It is shown here that for equal parameters similar explicit formulas do exist, too, facilitating the application of the Newton-Raphson procedure to estimate the parameters in the Rasch model and related models according to the conditional maximum likelihood principle.The author wishes to thank the reviewers for their helpful comments on an earlier draft of this paper.     

A maximum likelihood method for fitting the wandering vector model

After introducing some extensions of a recently proposed probabilistic vector model for representing paired comparisons choice data, an iterative procedure for obtaining maximum likelihood estimates of the model parameters is developed. The possibility of testing various hypotheses by means of likelihood ratio tests is discussed. Finally, the algorithm is applied to some existing data sets for illustrative purposes.