Improve robustness of sparse PCA by \(L_{1}\)-norm maximization
From MaRDI portal
Publication:645882
DOI10.1016/j.patcog.2011.07.009zbMath1225.68202OpenAlexW2066576934MaRDI QIDQ645882
Qian Zhao, De-Yu Meng, Zong Ben Xu
Publication date: 10 November 2011
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2011.07.009
Factor analysis and principal components; correspondence analysis (62H25) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (24)
The worst-case discounted regret portfolio optimization problem ⋮ Alternating maximization: unifying framework for 8 sparse PCA formulations and efficient parallel codes ⋮ Robust projection twin support vector machine via DC programming ⋮ Unnamed Item ⋮ Sparse and kernel OPLS feature extraction based on eigenvalue problem solving ⋮ Lp- and Ls-norm distance based robust linear discriminant analysis ⋮ Robust capped L1-norm twin support vector machine ⋮ Flexible non-greedy discriminant subspace feature extraction ⋮ L1-norm-based principal component analysis with adaptive regularization ⋮ A joint-norm distance metric 2DPCA for robust dimensionality reduction ⋮ Robust capped L1-norm projection twin support vector machine ⋮ Improve robustness and accuracy of deep neural network with \(L_{2,\infty}\) normalization ⋮ Avoiding Optimal Mean ℓ2,1-Norm Maximization-Based Robust PCA for Reconstruction ⋮ 2DPCA with L1-norm for simultaneously robust and sparse modelling ⋮ Comparing Classical and Robust Sparse PCA ⋮ Statistical Inference for High-Dimensional Matrix-Variate Factor Models ⋮ Batch gradient method with smoothing \(L_{1/2}\) regularization for training of feedforward neural networks ⋮ Unnamed Item ⋮ Sparse Principal Component Analysis via Variable Projection ⋮ Recursive linearization method for inverse medium scattering problems with complex mixture Gaussian error learning ⋮ A new approach for worst-case regret portfolio optimization problem ⋮ Center-based l1–clustering method ⋮ Robust sparse principal component analysis ⋮ Combined supervised information with PCA via discriminative component selection
Cites Work
- An augmented Lagrangian approach for sparse principal component analysis
- Sparse principal component analysis via regularized low rank matrix approximation
- A framework for robust subspace learning
- Robust principal component analysis?
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- Unnamed Item
- Unnamed Item
This page was built for publication: Improve robustness of sparse PCA by \(L_{1}\)-norm maximization
