Low rank approximation of binary matrices: column subset selection and generalizations
From MaRDI portal
Recommendations
- Approximation Schemes for Low-rank Binary Matrix Approximation Problems
- Parameterized low-rank binary matrix approximation
- Parameterized low-rank binary matrix approximation
- A clustering approach to constrained binary matrix factorization
- Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods
Cites work
- A clustering approach to constrained binary matrix factorization
- Adaptive Sampling and Fast Low-Rank Matrix Approximation
- An improved approximation algorithm for the column subset selection problem
- Column subset selection via sparse approximation of SVD
- Column subset selection, matrix factorization, and eigenvalue optimization
- Computing rank-revealing QR factorizations of dense matrices
- Covering graphs with few complete bipartite subgraphs
- Dimensionality reduction for k-means clustering and low rank approximation
- Discovery of optimal factors in binary data via a novel method of matrix decomposition
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Fast monte-carlo algorithms for finding low-rank approximations
- Generalized p-center problems: Complexity results and approximation algorithms
- Generalized Independent Component Analysis Over Finite Alphabets
- scientific article; zbMATH DE number 3597878 (Why is no real title available?)
- scientific article; zbMATH DE number 3046994 (Why is no real title available?)
- Inapproximability of Maximum Weighted Edge Biclique and Its Applications
- Independent Component Analysis Over Galois Fields of Prime Order
- Low‐rank revealing QR factorizations
- Matrix approximation and projective clustering via volume sampling
- Multi-assignment clustering for Boolean data
- Near-optimal column-based matrix reconstruction
- Noisy-OR component analysis and its application to link analysis
- Numerical methods for solving linear least squares problems
- On Rank-Revealing Factorisations
- On the complexity of robust PCA and \(\ell_1\)-norm low-rank matrix approximation
- On the existence and computation of rank-revealing LU factorizations
- On the Hardness of Decoding the Gale–Berlekamp Code
- Randomized Algorithms for Matrices and Data
- Rang revealing QR factorizations
- Rank and null space calculations using matrix decomposition without column interchanges
- Rank-Revealing QR Factorizations and the Singular Value Decomposition
- Relative-Error CUR Matrix Decompositions
Cited in
(8)- Parameterized low-rank binary matrix approximation
- Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis
- scientific article; zbMATH DE number 6982912 (Why is no real title available?)
- A clustering approach to constrained binary matrix factorization
- Approximation Schemes for Low-rank Binary Matrix Approximation Problems
- Parameterized low-rank binary matrix approximation
- New subset selection algorithms for low rank approximation: offline and online
- Binary matrix factorization and completion via integer programming
This page was built for publication: Low rank approximation of binary matrices: column subset selection and generalizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5005143)
