Sparse principal component analysis subject to prespecified cardinality of loadings
From MaRDI portal
Publication:333376
DOI10.1007/s00180-015-0608-4zbMath1348.65014OpenAlexW1835177631MaRDI QIDQ333376
Nickolay T. Trendafilov, Kohei Adachi
Publication date: 28 October 2016
Published in: Computational Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00180-015-0608-4
Computational methods for problems pertaining to statistics (62-08) Factor analysis and principal components; correspondence analysis (62H25)
Related Items (7)
High-dimensional disjoint factor analysis with its EM algorithm version ⋮ Sparse Tucker2 analysis of three-way data subject to a constrained number of zero elements in a core array ⋮ Sparse correspondence analysis for large contingency tables ⋮ Sparsifying the least-squares approach to PCA: comparison of lasso and cardinality constraint ⋮ Principal component analysis constrained by layered simple structures ⋮ An empirical comparison of two approaches for CDPCA in high-dimensional data ⋮ A guide for sparse PCA: model comparison and applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis
- Sparse versus simple structure loadings
- Sparse principal component analysis via regularized low rank matrix approximation
- Estimating the dimension of a model
- Principal component analysis.
- From simple structure to sparse components: a review
- Sparse principal components by semi-partition clustering
- Constrained Principal Component Analysis and Related Techniques
- Generalized power method for sparse principal component analysis
- Modern Multivariate Statistical Techniques
- A new look at the statistical model identification
This page was built for publication: Sparse principal component analysis subject to prespecified cardinality of loadings
