Improve robustness of sparse PCA by L1-norm maximization
Authors:
- Deyu MengDMDeyu Meng
- Qian ZhaoQZQian Zhao
- Zongben XuZXZongben Xu
- 1 January 2012
- journal article
- Published by Elsevier in Pattern Recognition
- Vol. 45 (1) , 487-497
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Robust principal component analysis?Journal of the ACM, 2011
- An augmented Lagrangian approach for sparse principal component analysisMathematical Programming, 2011
- Sparse principal component analysis via regularized low rank matrix approximationJournal of Multivariate Analysis, 2008
- Robust Face Recognition via Sparse RepresentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2008
- Sparse Principal Component AnalysisJournal of Computational and Graphical Statistics, 2006
- Robust factorizationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2002
- Eigenfaces vs. Fisherfaces: recognition using class specific linear projectionIEEE Transactions on Pattern Analysis and Machine Intelligence, 1997
- A L 1-norm PCA and a Heuristic Approach1996
- Loading and correlations in the interpretation of principle compenentsJournal of Applied Statistics, 1995
- Rotation of principal components: choice of normalization constraintsJournal of Applied Statistics, 1995