From simple structure to sparse components: a review
From MaRDI portal
(Redirected from Publication:2259727)
Recommendations
- Sparse versus simple structure loadings
- A guide for sparse PCA: model comparison and applications
- SIMPCA: a framework for rotating and sparsifying principal components
- Weakly correlated sparse components with nearly orthonormal loadings
- Orthogonal simple component analysis: a new, exploratory approach
Cites work
- scientific article; zbMATH DE number 3829076 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 3045859 (Why is no real title available?)
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- A clustering approach to interpretable principal components
- A majorization-minimization approach to the sparse generalized eigenvalue problem
- A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis
- Alternating maximization: unifying framework for 8 sparse PCA formulations and efficient parallel codes
- An augmented Lagrangian approach for sparse principal component analysis
- Bayesian Robust Principal Component Analysis
- Clustering and disjoint principal component analysis
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Exact Regularization of Convex Programs
- Foundations of factor analysis
- Generalized power method for sparse principal component analysis
- Ideal spatial adaptation by wavelet shrinkage
- Inequalities: theory of majorization and its applications
- Interpretable dimension reduction
- On consistency and sparsity for principal components analysis in high dimensions
- On the ``degrees of freedom of the lasso
- Optimal solutions for sparse principal component analysis
- Principal component analysis.
- Projected gradient approach to the numerical solution of the SCoTLASS
- Simple Component Analysis
- Simple Principal Components
- Sparse PCA: optimal rates and adaptive estimation
- Sparse principal component analysis by choice of norm
- Sparse principal component analysis via regularized low rank matrix approximation
- Sparse principal components by semi-partition clustering
- The Cayley transform in the numerical solution of unitary differential systems
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- The Geometry of Algorithms with Orthogonality Constraints
- The multimode Procrustes problem
Cited in
(24)- Sparse factor analysis for categorical data with the group-sparse generalized singular value decomposition
- Alternating maximization: unifying framework for 8 sparse PCA formulations and efficient parallel codes
- Sparsest factor analysis for clustering variables: a matrix decomposition approach
- Sparse exploratory factor analysis
- Sparse correspondence analysis for large contingency tables
- scientific article; zbMATH DE number 7387188 (Why is no real title available?)
- The R package ecosystem for robust statistics
- Exploratory procedure for component-based structural equation modeling for simple structure by simultaneous rotation
- Weakly correlated sparse components with nearly orthonormal loadings
- Rotation to sparse loadings using L^p losses and related inference problems
- Sparse matrices in data analysis
- SIMPCA: a framework for rotating and sparsifying principal components
- Sparse Tucker2 analysis of three-way data subject to a constrained number of zero elements in a core array
- Sparse principal component analysis subject to prespecified cardinality of loadings
- Sparsifying the least-squares approach to PCA: comparison of lasso and cardinality constraint
- Sparse and simple structure estimation via prenet penalization
- Orthogonal simple component analysis: a new, exploratory approach
- Recipes for sparse LDA of horizontal data
- Least squares sparse principal component analysis: a backward elimination approach to attain large loadings
- Sparse versus simple structure loadings
- A guide for sparse PCA: model comparison and applications
- \(\mathrm{C_{enet}Biplot}\): a new proposal of sparse and orthogonal biplots methods by means of elastic net CSVD
- Approximated penalized maximum likelihood for exploratory factor analysis: an orthogonal case
- Every trait counts: marginal maximum likelihood estimation for novel multidimensional count data item response models with rotation or _1-regularization for simple structure
This page was built for publication: From simple structure to sparse components: a review
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2259727)
