Sparse principal component analysis via fractional function regularity
Summary: In this paper, we describe a novel approach to sparse principal component analysis (SPCA) via a nonconvex sparsity-inducing fraction penalty function SPCA (FP-SPCA). Firstly, SPCA is reformulated as a fraction penalty regression problem model. Secondly, an algorithm corresponding to the model is proposed and the convergence of the algorithm is guaranteed. Finally, numerical experiments were carried out on a synthetic data set, and the experimental results show that the FP-SPCA method is more adaptable and has a better performance in the tradeoff between sparsity and explainable variance than SPCA.
- Sparse functional principal component analysis via regularized basis expansions and its appli\-cation
- Sparse functional principal component analysis in a new regression framework
- Sparse Functional Principal Component Analysis in High Dimensions
- Sparse principal component analysis via regularized low rank matrix approximation
- Sparse principal component analysis in Hilbert space
- An exact approach to sparse principal component analysis
- Approximation bounds for sparse principal component analysis
- A criterion for the construction of a regularization function in sparse component analysis
- Sparse principal component analysis by choice of norm
- The sparse principal component analysis problem: optimality conditions and algorithms
- <formula formulatype="inline"><tex Notation="TeX">$L_{1/2}$</tex> </formula> Regularization: Convergence of Iterative Half Thresholding Algorithm
- \(S_{1/2}\) regularization methods and fixed point algorithms for affine rank minimization problems
- A generalized solution of the orthogonal Procrustes problem
- A survey of \(L_1\) regression
- Bootstrapping Lasso estimators
- Compressed sensing
- scientific article; zbMATH DE number 3673370 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Least angle and \(\ell _{1}\) penalized regression: a review
- Least angle regression. (With discussion)
- Pathwise coordinate optimization
- Principal component analysis.
- Regression Shrinkage and Selection via The Lasso: A Retrospective
- Regularization and Variable Selection Via the Elastic Net
- Stable signal recovery from incomplete and inaccurate measurements
- The Adaptive Lasso and Its Oracle Properties
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Variable inclusion and shrinkage algorithms
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Sparse principal component analysis via variable projection
- EMD-based analysis of complexity with dissociated EEG amplitude and frequency information: a data-driven robust tool -- for autism diagnosis -- compared to multi-scale entropy approach
- Penalty-free sparse PCA
- Fast deflation sparse principal component analysis via subspace projections
- Sparse principal component analysis based on transformed \({L_1}\) penalty
- Group Lasso based selection for high-dimensional mediation analysis
- An augmented Lagrangian approach for sparse principal component analysis
- Sparse principal component analysis via regularized low rank matrix approximation
This page was built for publication: Sparse principal component analysis via fractional function regularity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2007153)
