Algorithms for unweighted least-squares factor analysis

Research output: Contribution to journalArticleAcademicpeer-review

Abstract

Estimation of the factor model by unweighted least squares (ULS) is distribution free, yields consistent estimates, and is computationally fast if the Minimum Residuals (MinRes) algorithm is employed. MinRes algorithms produce a converging sequence of monotonically decreasing ULS function values. Various suggestions for algorithms of the MinRes type are made for confirmatory as well as for exploratory factor analysis. These suggestions include the implementation of inequality constraints and the prevention of Heywood cases. A simulation study, comparing the bootstrap standard deviations for the parameters with the standard errors from maximum likelihood, indicates that these are virtually equal when the score vectors are sampled from the normal distribution. Two empirical examples demonstrate the usefulness of constrained exploratory and confirmatory factor analysis by ULS used in conjunction with the bootstrap method.
Original languageEnglish
Pages (from-to)133-147
JournalComputational statistics and data analysis
Volume21
Issue number2
DOIs
Publication statusPublished - Feb 1996

Keywords

  • statistics
  • algorithms

Cite this

@article{eeee0334d08c432fad928524ca0c22dc,
title = "Algorithms for unweighted least-squares factor analysis",
abstract = "Estimation of the factor model by unweighted least squares (ULS) is distribution free, yields consistent estimates, and is computationally fast if the Minimum Residuals (MinRes) algorithm is employed. MinRes algorithms produce a converging sequence of monotonically decreasing ULS function values. Various suggestions for algorithms of the MinRes type are made for confirmatory as well as for exploratory factor analysis. These suggestions include the implementation of inequality constraints and the prevention of Heywood cases. A simulation study, comparing the bootstrap standard deviations for the parameters with the standard errors from maximum likelihood, indicates that these are virtually equal when the score vectors are sampled from the normal distribution. Two empirical examples demonstrate the usefulness of constrained exploratory and confirmatory factor analysis by ULS used in conjunction with the bootstrap method.",
keywords = "statistics, algorithms, statistiek, algoritmen",
author = "Krijnen, {Wim P.}",
year = "1996",
month = "2",
doi = "10.1016/0167-9473(95)00011-9",
language = "English",
volume = "21",
pages = "133--147",
journal = "Computational statistics and data analysis",
issn = "0167-9473",
publisher = "Elsevier",
number = "2",

}

Algorithms for unweighted least-squares factor analysis. / Krijnen, Wim P.

In: Computational statistics and data analysis, Vol. 21, No. 2, 02.1996, p. 133-147.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Algorithms for unweighted least-squares factor analysis

AU - Krijnen, Wim P.

PY - 1996/2

Y1 - 1996/2

N2 - Estimation of the factor model by unweighted least squares (ULS) is distribution free, yields consistent estimates, and is computationally fast if the Minimum Residuals (MinRes) algorithm is employed. MinRes algorithms produce a converging sequence of monotonically decreasing ULS function values. Various suggestions for algorithms of the MinRes type are made for confirmatory as well as for exploratory factor analysis. These suggestions include the implementation of inequality constraints and the prevention of Heywood cases. A simulation study, comparing the bootstrap standard deviations for the parameters with the standard errors from maximum likelihood, indicates that these are virtually equal when the score vectors are sampled from the normal distribution. Two empirical examples demonstrate the usefulness of constrained exploratory and confirmatory factor analysis by ULS used in conjunction with the bootstrap method.

AB - Estimation of the factor model by unweighted least squares (ULS) is distribution free, yields consistent estimates, and is computationally fast if the Minimum Residuals (MinRes) algorithm is employed. MinRes algorithms produce a converging sequence of monotonically decreasing ULS function values. Various suggestions for algorithms of the MinRes type are made for confirmatory as well as for exploratory factor analysis. These suggestions include the implementation of inequality constraints and the prevention of Heywood cases. A simulation study, comparing the bootstrap standard deviations for the parameters with the standard errors from maximum likelihood, indicates that these are virtually equal when the score vectors are sampled from the normal distribution. Two empirical examples demonstrate the usefulness of constrained exploratory and confirmatory factor analysis by ULS used in conjunction with the bootstrap method.

KW - statistics

KW - algorithms

KW - statistiek

KW - algoritmen

U2 - 10.1016/0167-9473(95)00011-9

DO - 10.1016/0167-9473(95)00011-9

M3 - Article

VL - 21

SP - 133

EP - 147

JO - Computational statistics and data analysis

JF - Computational statistics and data analysis

SN - 0167-9473

IS - 2

ER -