Approximation Algorithms for Sparse Principal Component Analysis.
Agniva ChowdhuryPetros DrineasDavid P. WoodruffSamson ZhouPublished in: CoRR (2020)
Keyphrases
- approximation algorithms
- sparse principal component analysis
- np hard
- special case
- worst case
- minimum cost
- facility location problem
- vertex cover
- randomized algorithms
- set cover
- approximation ratio
- approximation schemes
- network design problem
- polynomial time approximation
- principle component analysis
- primal dual
- combinatorial auctions
- feature extraction
- open shop
- constant factor approximation
- approximation guarantees
- constant factor
- disjoint paths
- upper bound
- optimal solution