Sparse Exploratory Factor Analysis

Psychometrika

Volumn 82, Issue 3, 2017, Pages 778-794

  Trendafilov, Nickolay T ^a   Fontanella, Sara ^b   Adachi, Kohei ^c  

^a OPEN UNIVERSITY   (United Kingdom)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

^c OSAKA UNIVERSITY   (Japan)

Author keywords

eigenvalue reparameterization; optimization on matrix manifolds; penalties inducing sparseness

Indexed keywords

EID: 85023753659     PISSN: 00333123     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11336-017-9575-8     Document Type: Article

References (21)

1. Absil, P.-A., Mahony, R., & Sepulchre, R. (2008). Optimization algorithms on matrix manifolds. Princeton, NJ: Princeton University Press.
2. Boumal, N., Mishra, B., Absil, P.-A., & Sepulchre, R. (2014). MANOPT: a Matlab toolbox for optimization on manifolds. Journal of Machine Learning Research, 15, 1455–1459.
3. Choi, J., Zou, H., & Oehlert, G. (2011). A penalized maximum likelihood approach to sparse factor analysis. Statistics and Its Interface, 3, 429–436.
4. Del Buono, N., & Lopez, L. (2001). Runge–Kutta type methods based on geodesics for systems of ODEs on the Stiefel manifold. BIT Numerical Mathematics, 41(5), 912–923.
5. Edelman, A., Arias, T. A., & Smith, S. T. (1998). The geometry of algorithms with orthogonality constraints. SIAM Journal on Matrix Analysis and Applications, 20, 303–353.
6. Fontanella, S., Trendafilov, N., & Adachi, K. (2014). Sparse exploratory factor analysis. In Proceedings of COMPSTAT, 2014 (pp. 281–288).
7. 0 -surrogates. Computational Statistics, 29, 467–487.
8. Harman, H. H. (1976). Modern factor analysis (3rd ed.). Chicago, IL: University of Chicago Press.
9. Hirose, K., & Yamamoto, M. (2014). Estimation of an oblique structure via penalized likelihood factor analysis. Computational Statistics and Data Analysis, 79, 120–132.
10. Hirose, K., & Yamamoto, M. (2015). Sparse estimation via nonconcave penalized likelihood in a factor analysis model. Statistics and Computing, 25, 863–875.
11. Jolliffe, I. T. (2002). Principal component analysis (2nd ed.). New York, NY: Springer-verlag.
12. Jöreskog, K. G. (1977). Factor analysis by least-squares and maximum likelihood methods. In K. Enslein, A. Ralston, & H. S. Wilf (Eds.), Mathematical methods for digital computers (pp. 125–153). New York, NY: John Wiley & Sons.
13. Luss, R., & Teboulle, M. (2013). Conditional gradient algorithms for rank-one matrix approximations with a sparsity constraint. SIAM Review, 55, 65–98.
14. MATLAB. (2014). MATLAB R2014b. New York, NY: The MathWorks Inc.
15. Mulaik, S. A. (2010). The foundations of factor analysis (2nd ed.). Boca Raton, FL: Chapman and Hall/CRC.
16. 1 -regularization. In 50th IEEE conference on decision and control and european control conference (CDC-ECC) Orlando, FL, USA, December 12–15, 2011.
17. Trendafilov, N. T. (2003). Dynamical system approach to factor analysis parameter estimation. British Journal of Mathematical and Statistical Psychology, 56, 27–46.
18. Trendafilov, N. T. (2014). From simple structure to sparse components: A review. Computational Statistics, 29, 431–454.
19. Trendafilov, N. T., & Adachi, K. (2015). Sparse versus simple structure loadings. Psychometrika, 80, 776–790.
20. Trendafilov, N. T., & Jolliffe, I. T. (2006). Projected gradient approach to the numerical solution of the SCoTLASS. Computational Statistics and Data Analysis, 50, 242–253.
21. Wen, Z., & Yin, W. (2013). A feasible method for optimization with orthogonality constraints. Mathematical Programming, 142, 397–434.