Before revision: We present three provably accurate, polynomial time, approximation algorithms for the Sparse Principal Component Analysis (SPCA ) problem, without imposing any restrictive assumptions on the input covariance matrix.
After revision: We present three provably accurate, polynomial time, approximation algorithm for the SPCA problem, without imposing any restrictive assumptions on the input covariance matrix.