Low-rank binary matrix approximation in column-sum norm
From MaRDI portal
Cites work
- A clustering approach to constrained binary matrix factorization
- A PTAS for ℓp-Low Rank Approximation
- Analysis of a complex of statistical variables into principal components.
- Approximation algorithms for Hamming clustering problems
- Approximation Schemes for Low-rank Binary Matrix Approximation Problems
- Authoritative sources in a hyperlinked environment
- Combinatorial Pattern Matching
- Discovery of optimal factors in binary data via a novel method of matrix decomposition
- Generalized Independent Component Analysis Over Finite Alphabets
- Independent Component Analysis Over Galois Fields of Prime Order
- Low rank approximation of binary matrices: column subset selection and generalizations
- Low rank approximation with entrywise \(\ell_1\)-norm error
- Lower bounds for approximation schemes for Closest String
- More efficient algorithms for closest string and substring problems
- On lines and planes of closest fit to systems of points in space.
- On the closest string and substring problems
- On the complexity of robust PCA and \(\ell_1\)-norm low-rank matrix approximation
- Optimal decompositions of matrices with grades into binary and graded matrices
- Parameterized low-rank binary matrix approximation
- Polynomial-time approximation schemes for geometric min-sum median clustering
- Randomized Algorithms for Matrices and Data
- Sketching as a tool for numerical linear algebra
- SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS
- The approximation of one matrix by another of lower rank.
- Using Linear Algebra for Intelligent Information Retrieval
This page was built for publication: Low-rank binary matrix approximation in column-sum norm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7396345)
