Robust sparse principal component analysis

DOI10.1007/s11432-013-4970-yzbMath1428.62263OpenAlexW2139346561MaRDI QIDQ2335927

Qian Zhao, Zong Ben Xu, De-Yu Meng

Publication date: 18 November 2019

Published in: Science China. Information Sciences (Search for Journal in Brave)

Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-013-4970-y

zbMATH Keywords

noiserobustnessprincipal component analysisoutliersparsity

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Image analysis in multivariate analysis (62H35) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Cites Work

• Sparse SAR imaging based on \(L_{1/2}\) regularization
• Improve robustness of sparse PCA by \(L_{1}\)-norm maximization
• An augmented Lagrangian approach for sparse principal component analysis
• Iterative hard thresholding for compressed sensing
• Sparse principal component analysis via regularized low rank matrix approximation
• A framework for robust subspace learning
• Generalized power method for sparse principal component analysis
• On $l_q$ Optimization and Matrix Completion
• L 1/2 regularization
• A Direct Formulation for Sparse PCA Using Semidefinite Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Robust sparse principal component analysis