Sparse principal component analysis and iterative thresholding

From MaRDI portal
Publication:355104

DOI10.1214/13-AOS1097zbMATH Open1267.62074arXiv1112.2432MaRDI QIDQ355104FDOQ355104


Authors: Zongming Ma Edit this on Wikidata


Publication date: 24 July 2013

Published in: The Annals of Statistics (Search for Journal in Brave)

Abstract: Principal component analysis (PCA) is a classical dimension reduction method which projects data onto the principal subspace spanned by the leading eigenvectors of the covariance matrix. However, it behaves poorly when the number of features p is comparable to, or even much larger than, the sample size n. In this paper, we propose a new iterative thresholding approach for estimating principal subspaces in the setting where the leading eigenvectors are sparse. Under a spiked covariance model, we find that the new approach recovers the principal subspace and leading eigenvectors consistently, and even optimally, in a range of high-dimensional sparse settings. Simulated examples also demonstrate its competitive performance.


Full work available at URL: https://arxiv.org/abs/1112.2432




Recommendations




Cites Work


Cited In (only showing first 100 items - show all)

Uses Software





This page was built for publication: Sparse principal component analysis and iterative thresholding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q355104)