On Estimation of Sparse Factor Loadings using Distribution-free Approach
| dc.contributor.author | Adekeye, Kayode | |
| dc.date.accessioned | 2022-05-06T12:33:04Z | |
| dc.date.available | 2022-05-06T12:33:04Z | |
| dc.date.issued | 2020 | |
| dc.description.abstract | Sparse Factor Analysis (SFA) is often used for the analysis of high dimensional data, providing simpler pattern of factor loadings by constraining insigni cant loadings to be zero. However, existing SFA approaches require the assumption of normality of data since sparse factor loadings are obtained through a likelihood function with additional constraint or penalty function. This work proposes a method for obtaining sparse factor loadings without requiring any distributional assumption. In this method, the orthogonal sparse eigenvectors were computed based on Procrustes reformulation, and thereafter, an iterative procedure was provided to nd sparse factor loadings corresponding to the orthogonal sparse eigenvectors. In the end, the proposed method was compared with penalized likelihood factor analysis via nonconvex penalties using simulated data. Results show that sparse factor loadings from both methods provide simpler structure of factor loadings than the structure obtained from standard Exploratory Factor Analysis. In addition, the new method out-performs the penalized likelihood factor analysis via nonconvex penalties as it provides smaller values of MSE even when the two methods have the same level of sparsity. | en_US |
| dc.identifier.uri | http://dspace.run.edu.ng:8080/jspui/handle/123456789/2768 | |
| dc.language.iso | en | en_US |
| dc.subject | Exploratory factor analysis | en_US |
| dc.subject | Factor loadings | en_US |
| dc.subject | Sparsity | en_US |
| dc.subject | Sparse eigenvectors | en_US |
| dc.subject | Regularized maximum likelihood. | en_US |
| dc.title | On Estimation of Sparse Factor Loadings using Distribution-free Approach | en_US |
| dc.type | Article | en_US |