An efficient algorithm for joint correspondence analysis
From MaRDI portal
Publication:676500
DOI10.1007/BF02294338zbMath0881.62065OpenAlexW1988108560MaRDI QIDQ676500
Publication date: 18 March 1997
Published in: Psychometrika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02294338
factor analysismultiple correspondence analysisMINRESjoint correspondence analysisreduced-rank models
Related Items (2)
Simple Correspondence Analysis: A Bibliographic Review ⋮ A noniterative method of joint correspondence analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A general solution of the weighted orthonormal Procrustes problem
- A new algorithm for the least-squares solution in factor analysis
- Minimization of a class of matrix trace functions by means of refined majorization
- A note on the minres method
- Resolution of the Heywood case in the minres solution
- The Modified Gauss-Newton Method for the Fitting of Non-Linear Regression Functions by Least Squares
- Correspondence analysis of multivariate categorical data by weighted least-squares
This page was built for publication: An efficient algorithm for joint correspondence analysis