Robust sparse L_p-norm principal component analysis

DOI10.16383/J.AAS.2017.C150512zbMATH Open1389.62099OpenAlexW2595077103WikidataQ118420624 ScholiaQ118420624MaRDI QIDQ5367549FDOQ5367549

Chunna Li, Yuan-Hai Shao, Weijie Chen

Publication date: 20 October 2017

Full work available at URL: http://www.aas.net.cn/article/app/id/18995/reference

Recommendations

• Robust sparse principal component analysis
• Improve robustness of sparse PCA by \(L_{1}\)-norm maximization
• Joint sparse principal component analysis
• A pure \(L_1\)-norm principal component analysis
• L1-norm-based principal component analysis with adaptive regularization

zbMATH Keywords

principal component analysisdimensionality reductionrobustnesssparseness

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Pattern recognition, speech recognition (68T10)

Cited In (10)

• Robust Q-mode principal component analysis in \(L_{1}\)
• A novel robust principal component analysis algorithm of nonconvex rank approximation
• The nonconvex tensor robust principal component analysis approximation model via the weighted \(\ell_p\)-norm regularization
• Majorization-Minimization on the Stiefel Manifold With Application to Robust Sparse PCA
• Title not available (Why is that?)
• 2DPCA with L1-norm for simultaneously robust and sparse modelling
• Online Schatten quasi-norm minimization for robust principal component analysis
• L1-norm-based principal component analysis with adaptive regularization
• Robust principal component pursuit via inexact alternating minimization on matrix manifolds
• Robust sparse principal component analysis: situation of full sparseness

This page was built for publication: Robust sparse \(L_p\)-norm principal component analysis

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