Pages that link to "Item:Q484129"
From MaRDI portal
The following pages link to Approximation bounds for sparse principal component analysis (Q484129):
Displaying 15 items.
- Alternating direction method of multipliers for penalized zero-variance discriminant analysis (Q97537) (← links)
- High-dimensional analysis of semidefinite relaxations for sparse principal components (Q834367) (← links)
- Bounds on the quality of the PCA bounding boxes (Q1028234) (← links)
- Sparse principal component analysis via fractional function regularity (Q2007153) (← links)
- Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors (Q2162522) (← links)
- Distance geometry and data science (Q2192022) (← links)
- Sparsistency and agnostic inference in sparse PCA (Q2338928) (← links)
- Sparse PCA on fixed-rank matrices (Q2687042) (← links)
- The Sparse Principal Component of a Constant-Rank Matrix (Q2986449) (← links)
- (Q4900992) (← links)
- (Q5054600) (← links)
- Sparse Principal Component Analysis via Axis-Aligned Random Projections (Q5087136) (← links)
- Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA (Q5095184) (← links)
- Solving sparse principal component analysis with global support (Q6038649) (← links)
- Practical approximation algorithms for \(\ell_1\)-regularized sparse rank-1 approximation to higher-order tensors (Q6124341) (← links)
