A fast, provably accurate approximation algorithm for sparse principal component analysis reveals human genetic variation across the world
From MaRDI portal
Publication:2170129
DOI10.1007/978-3-031-04749-7_6zbMath1496.92049OpenAlexW4285303862MaRDI QIDQ2170129
David P. Woodruff, Samson Zhou, Agniva Chowdhury, Petros Drineas, Aritra N. Bose
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-04749-7_6
Factor analysis and principal components; correspondence analysis (62H25) Genetics and epigenetics (92D10) Approximation algorithms (68W25)
Related Items (2)
Uses Software
Cites Work
- CUR matrix decompositions for improved data analysis
- The sparse principal component analysis problem: optimality conditions and algorithms
- The Sparse Principal Component of a Constant-Rank Matrix
- Regularization and Variable Selection Via the Elastic Net
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
This page was built for publication: A fast, provably accurate approximation algorithm for sparse principal component analysis reveals human genetic variation across the world