Hostname: page-component-5f745c7db-2kk5n Total loading time: 0 Render date: 2025-01-06T22:18:05.215Z Has data issue: true hasContentIssue false
  • English
  • Français

An Efficient Algorithm for Joint Correspondence Analysis

Published online by Cambridge University Press:  01 January 2025

Robert J. Boik
Robert J. Boik*
Affiliation:
Department of Mathematical Sciences, Montana State University
*
Requests for reprints should be sent to Robert J. Boik, Department of Mathematical Sciences, Montana State University, Bozeman MT 59717-0240.
Get access Rights & Permissions [Opens in a new window]

Abstract

Joint correspondence analysis is a technique for constructing reduced-dimensional representations of pairwise relationships among categorical variables. The technique was proposed by Greenacre as an alternative to multiple correspondence analysis. Joint correspondence analysis differs from multiple correspondence analysis in that it focuses solely on between-variable relationships. Greenacre described one alternating least-squares algorithm for conducting joint correspondence analysis. Another alternating least-squares algorithm is described in this article. The algorithm is guaranteed to converge, and does so in fewer iterations than does the algorithm proposed by Greenacre. A modification of the algorithm for handling Heywood cases is described. The algorithm is illustrated on two data sets.

Keywords

factor analysisMINRESmultiple correspondence analysisreduced-rank models
Type
Original Paper
Information
Psychometrika , Volume 61 , Issue 2 , June 1996 , pp. 255 - 269
Copyright
Copyright © 1996 The Psychometric Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Cliff, N. (1966). Orthogonal rotation to congruence. Psychometrika, 31, 33–42.CrossRefGoogle Scholar
Dennis, J. E., Schnabel, R. B. (1983). Numerical methods for unconstrained optimization and nonlinear equations, Englewood Cliffs, NJ: Prentice-Hall.Google Scholar
Greenacre, M. J. (1988). Correspondence analysis of multivariate categorical data by weighted least-squares. Biometrika, 75, 457–467.CrossRefGoogle Scholar
Greenacre, M. J. (1990). Some limitations of correspondence analysis. Computational Statistics Quarterly, 3, 249–256.Google Scholar
Greenacre, M. J. (1991). Interpreting multiple correspondence analysis. Applied Stochastic Models and Data Analysis, 7, 195–210.CrossRefGoogle Scholar
Hafner, R. (1981). An improvement of the Harman-Fukuda-method for the minres solution in factor analysis. Psychometrika, 46, 347–349.CrossRefGoogle Scholar
Harman, H. H., Fukuda, Y. (1966). Resolution of the Heywood case in the Minres solution. Psychometrika, 31, 563–571.CrossRefGoogle Scholar
Harman, H. H., Jones, W. H. (1966). Factor analysis by minimizing residuals (Minres). Psychometrika, 31, 351–368.CrossRefGoogle ScholarPubMed
Hartley, H. O. (1961). The modified Gauss-Newton method for the fitting of nonlinear regression functions by least squares. Technometrics, 3, 269–280.CrossRefGoogle Scholar
Karakos, A. (1986). Calculation of nontrivial factors relative to the first eigenvalue in correspondence analysis. Cahiers de l'Analyse des Donnees, 11, 95–100.Google Scholar
Kiers, H. A. L., ten Berge, J. M. F. (1993). Minimizing a class of matrix trace functions by means of refined majorization. Psychometrika, 57, 371–382.CrossRefGoogle Scholar
Magnus, J. R., Neudecker, H. (1988). Matrix differential calculus with applications in statistics and econometrics, New York: John Wiley & Sons.Google Scholar
Mooijaart, A., Commandeur, J. J. F. (1990). A general solution of the weighted orthonormal Procrustes problem. Psychometrika, 55, 657–663.CrossRefGoogle Scholar
Nosal, M. (1977). A note on the minres method. Psychometrika, 42, 149–151.CrossRefGoogle Scholar
Okamoto, M., Ihara, M. (1983). A new algorithm for the least-squares solution in factor analysis. Psychometrika, 48, 597–605.CrossRefGoogle Scholar
Searle, S. R. (1982). Matrix algebra useful for statistics, New York: John Wiley & Sons.Google Scholar
ten Berge, J. M. F., Zegers, F. E. (1990). Convergence properties of certain Minres algorithms. Multivariate Behavioral Research, 25, 421–425.CrossRefGoogle ScholarPubMed
Zegers, F. E., ten Berge, J. M. F. (1983). A fast and simple computational method of minimum residual factor analysis. Multivariate Behavioral Research, 18, 331–340.CrossRefGoogle ScholarPubMed