Column Subset Selection Problem is UG-hard
نویسندگان
چکیده
منابع مشابه
Column subset selection is NP-complete
Let M be a real r × c matrix and let k be a positive integer. In the column subset selection problem (CSSP), we need to minimize the quantity M − SA, where A can be an arbitrary k × c matrix, and S runs over all r × k submatrices of M. This problem and its applications in numerical linear algebra are being discussed for several decades, but its algorithmic complexity remained an open issue. We ...
متن کاملAn improved approximation algorithm for the column subset selection problem
We consider the problem of selecting the “best” subset of exactly k columns from an m× n matrix A. In particular, we present and analyze a novel two-stage algorithm that runs in O(min{mn2,m2n}) time and returns as output an m × k matrix C consisting of exactly k columns of A. In the first stage (the randomized stage), the algorithm randomly selects O(k log k) columns according to a judiciously-...
متن کاملColumn Subset Selection with Missing Data
An important problem in massive data collection systems is to identify a representative subset of collection points from a given set of measurements. This problem is well cast in the literature as selecting representative columns from a low-rank data matrix. However, a challenge that arises immediately is that complete data are typically not available or are infeasible to collect in very large ...
متن کاملA Note on Column Subset Selection
Given a matrix U , using a deterministic method, we extract a "large" submatrix of Ũ (whose columns are obtained by normalizing those of U ) and estimate its smallest and largest singular value. We apply this result to the study of contact points of the unit ball with its maximal volume ellipsoid. We consider also the paving problem and give a deterministic algorithm to partition a matrix into ...
متن کاملec 2 00 8 An Improved Approximation Algorithm for the Column Subset Selection Problem ∗
We consider the problem of selecting the “best” subset of exactly k columns from an m× n matrix A. In particular, we present and analyze a novel two-stage algorithm that runs in O(min{mn2,m2n}) time and returns as output an m × k matrix C consisting of exactly k columns of A. In the first stage (the randomized stage), the algorithm randomly selects O(k log k) columns according to a judiciously-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2014
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2014.01.004