A note on identifiability conditions in confirmatory factor analysis

William Leeb

doi:10.1016/j.spl.2021.109190

A note on identifiability conditions in confirmatory factor analysis

William Leeb

School of Mathematics

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

Abstract

Recently, Chen, Li and Zhang established conditions characterizing asymptotic identifiability of latent factors in confirmatory factor analysis. We give an elementary proof showing that a similar characterization holds non-asymptotically, and prove a related result for identifiability of factor loadings.

Original language	English (US)
Article number	109190
Journal	Statistics and Probability Letters
Volume	178
DOIs	https://doi.org/10.1016/j.spl.2021.109190
State	Published - Nov 2021

Bibliographical note

Publisher Copyright:
© 2021 Elsevier B.V.

Keywords

Confirmatory factor analysis
Factor loadings
Identifiability
Latent factors
Matrix factorizations

Publisher link

10.1016/j.spl.2021.109190

Find It

Find It at U of M Libraries

Cite this

@article{056e8a5471dd4028bab1bf25db5da644,

title = "A note on identifiability conditions in confirmatory factor analysis",

abstract = "Recently, Chen, Li and Zhang established conditions characterizing asymptotic identifiability of latent factors in confirmatory factor analysis. We give an elementary proof showing that a similar characterization holds non-asymptotically, and prove a related result for identifiability of factor loadings.",

keywords = "Confirmatory factor analysis, Factor loadings, Identifiability, Latent factors, Matrix factorizations",

author = "William Leeb",

note = "Publisher Copyright: {\textcopyright} 2021 Elsevier B.V.",

year = "2021",

month = nov,

doi = "10.1016/j.spl.2021.109190",

language = "English (US)",

volume = "178",

journal = "Statistics and Probability Letters",

issn = "0167-7152",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - A note on identifiability conditions in confirmatory factor analysis

AU - Leeb, William

PY - 2021/11

Y1 - 2021/11

N2 - Recently, Chen, Li and Zhang established conditions characterizing asymptotic identifiability of latent factors in confirmatory factor analysis. We give an elementary proof showing that a similar characterization holds non-asymptotically, and prove a related result for identifiability of factor loadings.

AB - Recently, Chen, Li and Zhang established conditions characterizing asymptotic identifiability of latent factors in confirmatory factor analysis. We give an elementary proof showing that a similar characterization holds non-asymptotically, and prove a related result for identifiability of factor loadings.

KW - Confirmatory factor analysis

KW - Factor loadings

KW - Identifiability

KW - Latent factors

KW - Matrix factorizations

UR - https://www.scopus.com/pages/publications/85111058256

UR - https://www.scopus.com/pages/publications/85111058256#tab=citedBy

U2 - 10.1016/j.spl.2021.109190

DO - 10.1016/j.spl.2021.109190

M3 - Article

AN - SCOPUS:85111058256

SN - 0167-7152

VL - 178

JO - Statistics and Probability Letters

JF - Statistics and Probability Letters

M1 - 109190

ER -

A note on identifiability conditions in confirmatory factor analysis

Abstract

Bibliographical note

Keywords

Publisher link

Find It

Other files and links

Fingerprint

Cite this