Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection
نویسندگان
چکیده
منابع مشابه
Low Rank Approximation of Binary Matrices: Column Subset Selection and Generalizations
We consider the problem of low rank approximation of binary matrices. Here we are given a d × n binary matrix A and a small integer k < d. The goal is to find two binary matrices U and V of sizes d×k and k×n respectively, so that the Frobenius norm of A−UV is minimized. There are two models of this problem, depending on the definition of the product of binary matrices: The GF(2) model and the B...
متن کاملBlock-row Hankel weighted low rank approximation
This paper extends the Weighted Low Rank Approximation (WLRA) approach towards linearly structured matrices. In the case of Hankel matrices with a special block structure an equivalent unconstrained optimization problem is derived and an algorithm for solving it is proposed.
متن کاملLow-Rank Matrix Recovery from Row-and-Column Affine Measurements
We propose and study a row-and-column affine measurement scheme for low-rank matrix recovery. Each measurement is a linear combination of elements in one row or one column of a matrix X . This setting arises naturally in applications from different domains. However, current algorithms developed for standard matrix recovery problems do not perform well in our case, hence the need for developing ...
متن کاملfLRR: Fast Low-Rank Representation Using Frobenius Norm
Low Rank Representation (LRR) intends to find the representation with lowest-rank of a given data set, which can be formulated as a rank minimization problem. Since the rank operator is non-convex and discontinuous, most of the recent works use the nuclear norm as a convex relaxation. This letter theoretically shows that under some conditions, Frobenius-norm-based optimization problem has an un...
متن کامل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-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2020
ISSN: 0895-4798,1095-7162
DOI: 10.1137/19m1281848