TL;DR
This paper introduces Exploratory Graph Analysis (EGA), a novel method for estimating the number of dimensions in psychological data, demonstrating its effectiveness through extensive simulations and real data comparison.
Contribution
EGA is a new approach based on graphical lasso and community detection, outperforming traditional methods in certain complex factor structures.
Findings
EGA performs comparably to traditional methods in many scenarios.
EGA accurately estimates four-factor structures with high correlations.
EGA successfully applied to real data, showing practical utility.
Abstract
The estimation of the correct number of dimensions is a long-standing problem in psychometrics. Several methods have been proposed, such as parallel analysis (PA), Kaiser-Guttman's eigenvalue-greaterthan-one rule, multiple average partial procedure (MAP), the maximum-likelihood approaches that use fit indexes as BIC and EBIC and the less used and studied approach called very simple structure (VSS). In the present paper a new approach to estimate the number of dimensions will be introduced and compared via simulation to the traditional techniques pointed above. The approach proposed in the current paper is called exploratory graph analysis (EGA), since it is based on the graphical lasso with the regularization parameter specified using EBIC. The number of dimensions is verified using the walktrap, a random walk algorithm used to identify communities in networks. In total, 32,000 data…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
