Sparse exploratory factor analysis

DOI10.1007/s11336-017-9575-8zbMath1402.62129OpenAlexW205445820WikidataQ47766750 ScholiaQ47766750MaRDI QIDQ1682447

Kohei Adachi, Nickolay T. Trendafilov, Sara Fontanella

Publication date: 30 November 2017

Published in: Psychometrika (Search for Journal in Brave)

Full work available at URL: http://oro.open.ac.uk/51865/1/51865.pdf

zbMATH Keywords

eigenvalue reparameterizationoptimization on matrix manifoldspenalties inducing sparseness

Mathematics Subject Classification ID

Related Items (9)

Single- and multiple-group penalized factor analysis: a trust-region algorithm approach with integrated automatic multiple tuning parameter selection ⋮ Multidimensional item response theory in the style of collaborative filtering ⋮ Sparse exploratory factor analysis ⋮ Sparse correspondence analysis for large contingency tables ⋮ Sparse and simple structure estimation via prenet penalization ⋮ Sparse online principal component analysis for parameter estimation in factor model ⋮ In the pursuit of sparseness: a new rank-preserving penalty for a finite mixture of factor analyzers ⋮ Approximated penalized maximum likelihood for exploratory factor analysis: an orthogonal case ⋮ Semi-sparse PCA

Uses Software

• Matlab
• Manopt

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A feasible method for optimization with orthogonality constraints
• Sparse estimation via nonconcave penalized likelihood in factor analysis model
• A penalized maximum likelihood approach to sparse factor analysis
• Sparse versus simple structure loadings
• Projected gradient approach to the numerical solution of the SCoTLASS
• Estimation of an oblique structure via penalized likelihood factor analysis
• Sparse exploratory factor analysis
• Principal component analysis.
• From simple structure to sparse components: a review
• Robust PCA and subspace tracking from incomplete observations using \(\ell _0\)-surrogates
• Manopt, a Matlab toolbox for optimization on manifolds
• The Geometry of Algorithms with Orthogonality Constraints
• Conditional Gradient Algorithmsfor Rank-One Matrix Approximations with a Sparsity Constraint

This page was built for publication: Sparse exploratory factor analysis