Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An efficient algorithm for joint correspondence analysis

From MaRDI portal
Publication:676500
Jump to:navigation, search

DOI10.1007/BF02294338zbMath0881.62065OpenAlexW1988108560MaRDI QIDQ676500

Robert J. Boik

Publication date: 18 March 1997

Published in: Psychometrika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02294338


zbMATH Keywords

factor analysismultiple correspondence analysisMINRESjoint correspondence analysisreduced-rank models


Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25)


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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:676500&oldid=12585633"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 10:24.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki