# Low Rank Approximation of Binary Matrices: Column Subset Selection and Generalizations

@inproceedings{Dan2018LowRA,
title={Low Rank Approximation of Binary Matrices: Column Subset Selection and Generalizations},
author={Chen Dan and Kristoffer Arnsfelt Hansen and He Jiang and Liwei Wang and Yuchen Zhou},
booktitle={MFCS},
year={2018}
}
• Chen Dan, +2 authors Yuchen Zhou
• Published in MFCS 2018
• Mathematics, Computer Science
• Low rank matrix approximation is an important tool in machine learning. Given a data matrix, low rank approximation helps to find factors, patterns and provides concise representations for the data. Research on low rank approximation usually focus on real matrices. However, in many applications data are binary (categorical) rather than continuous. This leads to the problem of low rank approximation of binary matrix. Here we are given a $d \times n$ binary matrix $A$ and a small integer $k$. The… CONTINUE READING

#### Citations

##### Publications citing this paper.
SHOWING 1-6 OF 6 CITATIONS

## Approximation Algorithms for $\ell_0$-Low Rank Approximation

• Computer Science, Mathematics
• NIPS 2017
• 2017

## Optimal Analysis of Subset-Selection Based L_p Low Rank Approximation

• Mathematics, Computer Science
• NeurIPS
• 2019
VIEW 1 EXCERPT
CITES METHODS

## L G ] 3 0 O ct 2 01 9 Optimal Analysis of Subset-Selection Based l p Low-Rank Approximation

VIEW 2 EXCERPTS
CITES BACKGROUND & METHODS

## Approximation Algorithms for ࡁ0-Low Rank Approximation

• Computer Science
• NIPS
• 2017

## Streaming PTAS for Binary $\ell_0$-Low Rank Approximation

• Computer Science, Mathematics
• 2019

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 48 REFERENCES

## Mining discrete patterns via binary matrix factorization

• Mathematics, Computer Science
• KDD
• 2009
VIEW 2 EXCERPTS

## Relative-Error CUR Matrix Decompositions

• Computer Science, Mathematics
• SIAM J. Matrix Anal. Appl.
• 2008
VIEW 2 EXCERPTS

## Discovery of optimal factors in binary data via a novel method of matrix decomposition

• Mathematics, Computer Science
• J. Comput. Syst. Sci.
• 2010
VIEW 1 EXCERPT

## Dimensionality Reduction for k-Means Clustering and Low Rank Approximation

• Mathematics, Computer Science
• STOC '15
• 2015
VIEW 2 EXCERPTS

## Column subset selection via sparse approximation of SVD

• Mathematics, Computer Science
• Theor. Comput. Sci.
• 2012
VIEW 1 EXCERPT

## A Clustering Approach to Constrained Binary Matrix Factorization

• Computer Science
• 2014
VIEW 1 EXCERPT

## Adaptive Sampling and Fast Low-Rank Matrix Approximation

• Mathematics, Computer Science
• APPROX-RANDOM
• 2006
VIEW 2 EXCERPTS

## Efficient Volume Sampling for Row/Column Subset Selection

• Mathematics, Computer Science
• 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
• 2010
VIEW 2 EXCERPTS

## Column subset selection, matrix factorization, and eigenvalue optimization

VIEW 1 EXCERPT

## Fast Monte-Carlo algorithms for finding low-rank approximations

• Mathematics, Computer Science
• Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
• 1998
VIEW 1 EXCERPT