Sage Journals: Discover world-class research

Abstract

Rudas, Clogg, and Lindsay (1994) proposed a mixture index-of-fit approach for evaluating goodness of fit in the analysis of contingency tables. Clogg, Rudas, and Xi (1995) applied this approach to the analysis of models for mobility tables. The maximum likelihood estimate of the mixture index of fit π^* can be obtained by the expectation and maximization (EM) algorithm. The objective of this article is to describe an alternative algorithm, using sequential quadratic programming (SQP). Two major advantages SQP holds over the EM algorithm are the following: (1) The speed of convergence is greatly increased and (2) SQP is more general than the EM algorithm of Rudas et al. and does not require explicit maximum likelihood estimates. The SQP algorithm is available in the MATLAB package; a sample code is provided in the appendix.

Get full access to this article

View all access options for this article.

References

Agresti, Alan 1990. Categorical Data Analysis. New York: Wiley.

Boyles, Russell A. 1983. “On the Convergence of the EM Algorithm.” Journal of the Royal Statistical Society, Ser. B, 45:47-50.

Clogg, Clifford C. , Tamas Rudas , and Liwen Xi . 1995. “A New Index of Structure for the Analysis of Models for Mobility Tables and Other Cross-Classifications.” Sociological Methodology 25:197-222.

Dempster, Arthur P. , Nan M. Laird , and Donald B. Rubin . 1977. “Maximum Likelihood From Incomplete Data via the EM Algorithm.” Journal of the Royal Statistical Society, Ser. B, 39:1-38.

Featherman, David L. and Robert M. Hauser . 1978. Opportunity and Change. New York: Academic Press.

Grace, A. 1990. Optimization Toolbox. Natick, MA: MathWorks, Inc.

Horng, S. Crystal . 1987. “Examples of Sublinear Convergence of EM Algorithm.” ASA Proceedings of Statistical Computing Section, 266-271.

IMSL . 1989. User's Manual: IMSL Math/Library. Houston, TX: IMSL, Inc.

Lazarsfeld, Paul F. and Neil W. Henry . 1968. Latent Structure Analysis. Boston: Houghton Mifflin.

10.

Luenberger, David G. 1989. Linear and Nonlinear Programming. Reading, MA: Addison-Wesley.

11.

McCullagh, Peter and John A. Nelder . 1989. Generalized Linear Models. London: Chapman & Hall.

12.

Moré, Jorge J. and Stephen J. Wright . 1993. Optimization Software Guide. Philadelphia: Siam.

13.

Rudas, Tamas , Clifford C. Clogg , and Bruce G. Lindsay . 1994. “A New Index of Fit Based on Mixture Methods for the Analysis of Contingency Tables.” Journal of the Royal Statistical Society, Ser. B, 56:623-639.

14.

Schittkowski, Klaus 1985. Computational Mathematical Programming. Berlin: Springer-Verlag.

15.

Sundberg, Rolf . 1974. “Maximum Likelihood Theory for Incomplete Data From an Exponential Family.” Scandinavian Journal of Statistics 1:49-58.

16.

Sundberg, Rolf . 1976. “An Iterative Method for Solution of the Likelihood Equations for Incomplete Data From Exponential Families.” Communications in Statistics Part B 5:55-64.

17.

Titterington, D. Michael , Adrian F. Smith , and Udi Makov . 1985. Statistical Analysis of Finite Mixture Distributions. New York: Wiley.

18.

Wu, Jeff C. F. 1983. “On the Convergence Properties of the EM Algorithm.” The Annals of Statistics 11:95-103.

A Note on Calculating the π* Index of Fit for the Analysis of Contingency Tables

Abstract

Get full access to this article

References