Improve robustness of sparse PCA by L₁-norm maximization
From MaRDI portal
Publication:645882
Recommendations
Cites work
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- A framework for robust subspace learning
- An augmented Lagrangian approach for sparse principal component analysis
- scientific article; zbMATH DE number 1163871 (Why is no real title available?)
- Optimal solutions for sparse principal component analysis
- Robust principal component analysis?
- Sparse principal component analysis via regularized low rank matrix approximation
Cited in
(32)- Sparse principal component analysis via variable projection
- Sparse and kernel OPLS feature extraction based on eigenvalue problem solving
- Alternating maximization: unifying framework for 8 sparse PCA formulations and efficient parallel codes
- 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
- New robust PCA for outliers and heavy sparse noises' detection via affine transformation, the \(L_{\ast, w}\) and \(L_{2,1}\) norms, and spatial weight matrix in high-dimensional images: from the perspective of signal processing
- Joint sparse principal component analysis
- A new approach for worst-case regret portfolio optimization problem
- Robust sparse principal component analysis
- Combined supervised information with PCA via discriminative component selection
- L1-norm-based principal component analysis with adaptive regularization
- Robust capped L1-norm projection twin support vector machine
- Improve robustness and accuracy of deep neural network with \(L_{2,\infty}\) normalization
- The worst-case discounted regret portfolio optimization problem
- Comparing classical and robust sparse PCA
- A pure \(L_1\)-norm principal component analysis
- 2DPCA with L1-norm for simultaneously robust and sparse modelling
- Batch gradient method with smoothing \(L_{1/2}\) regularization for training of feedforward neural networks
- Recursive linearization method for inverse medium scattering problems with complex mixture Gaussian error learning
- Self-paced multi-view co-training
- scientific article; zbMATH DE number 7626798 (Why is no real title available?)
- Robust projection twin support vector machine via DC programming
- Majorization-Minimization on the Stiefel Manifold With Application to Robust Sparse PCA
- Robust sparse \(L_p\)-norm principal component analysis
- Avoiding optimal mean \(\ell_{2,1}\)-norm maximization-based robust PCA for reconstruction
- Robust L1 Principal Component Analysis and Its Bayesian Variational Inference
- Center-based l₁-clustering method
- A joint-norm distance metric 2DPCA for robust dimensionality reduction
- Statistical Inference for High-Dimensional Matrix-Variate Factor Models
- Linearized Bregman iteration based model-free adaptive sliding mode control for a class of non-linear systems
- _1-norm simultaneous approximate diagonalization and a proximal alternating maximization method
This page was built for publication: Improve robustness of sparse PCA by \(L_{1}\)-norm maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q645882)
