Robust principal component analysis: a factorization-based approach with linear complexity

DOI10.1016/j.ins.2019.09.074zbMath1457.62195OpenAlexW2979028048WikidataQ127216612 ScholiaQ127216612MaRDI QIDQ2660750

Qiang Cheng, Chenglizhao Chen, Chong Peng, Zhao Kang, Yongyong Chen

Publication date: 31 March 2021

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2019.09.074

zbMATH Keywords

factorizationlinear complexityrobust principal component analysis

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25)

Related Items (3)

Data representation using robust nonnegative matrix factorization for edge computing ⋮ Nonnegative matrix factorization with local similarity learning ⋮ Two-dimensional semi-nonnegative matrix factorization for clustering

Cites Work

• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A framework for robust subspace learning
• Two proposals for robust PCA using semidefinite programming
• A generalized solution of the orthogonal Procrustes problem
• Robust principal component analysis?
• A Singular Value Thresholding Algorithm for Matrix Completion
• Principal component analysis based on robust estimators of the covariance or correlation matrix: influence functions and efficiencies
• Bayesian Robust Principal Component Analysis
• Video Saliency Detection via Spatial-Temporal Fusion and Low-Rank Coherency Diffusion
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• Robust Statistics

This page was built for publication: Robust principal component analysis: a factorization-based approach with linear complexity