Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2505.21100 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912397836419072 |
|---|---|
| author | Kim, Dale S. Lu, Audrey Zhou, Qing |
| author_facet | Kim, Dale S. Lu, Audrey Zhou, Qing |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_21100 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The Correlation Thresholding Algorithm for Exploratory Factor Analysis Kim, Dale S. Lu, Audrey Zhou, Qing Methodology 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. |
| title | The Correlation Thresholding Algorithm for Exploratory Factor Analysis |
| topic | Methodology |
| url | https://arxiv.org/abs/2505.21100 |