arrow
返回

The Correlation Thresholding Algorithm for Exploratory Factor Analysis

delete2025-06-23
delete0
delete
OA
AI
D
Dale S. Kim *
A
Audrey Lu
Q
Qing Zhou *
DOI:10.1080/10705511.2025.2512350delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Exploratory factor analysis is often used in the social sciences to estimate potential measurement models. To do this, several important issues need to be addressed: (1) determining the number of factors, (2) learning constraints in the factor loadings, and (3) selecting a solution amongst rotationally equivalent choices. Traditionally, these issues are treated separately. This work examines the Correlation Thresholding (CT) algorithm, which uses a graph-theoretic perspective to solve all three simultaneously, from a unified framework. Despite this advantage, it relies on several assumptions that may not hold in practice. We discuss the implications of these assumptions and assess the sensitivity of the CT algorithm to them for practical use in exploratory factor analysis. This is examined over a series of simulation studies, as well as a real data example. The CT algorithm shows reasonable robustness against violating these assumptions and very competitive performance in comparison to other methods.
Keyword:
Cliques
correlation
factor analysis
graphs
thresholding

期刊

S
Structural Equation Modeling-A Multidisciplinary Journal
IF:
3.2
论文数:
94
被引数:
2.1W

机构

U
university of california
学者数:
1.9W
论文数: 8.0K
被引数: 10
引用论文

引用论文

学者 查看更多内容