On Low Rank Approximation of Binary Matrices
CoRR, Volume abs/1511.01699, 2015.
We consider the problem of low rank approximation of binary matrices. Here we are given a $d \times n$ binary matrix $A$ and a small integer $k < d$. The goal is to find two binary matrices $U$ and $V$ of sizes $d \times k$ and $k \times n$ respectively, so that the Frobenius norm of $A-U V$ is minimized. There are two models of this pr...More
PPT (Upload PPT)