Low-Rank Binary Matrix Approximation in Column-Sum Norm.
From MaRDI portal
Publication:6062156
DOI10.4230/lipics.approx/random.2020.32arXiv1904.06141OpenAlexW3081933699MaRDI QIDQ6062156
Fedor V. Fomin, Kirill Simonov, Fahad Panolan, Petr A. Golovach
Publication date: 31 October 2023
Full work available at URL: https://arxiv.org/abs/1904.06141
Cites Work
- Discovery of optimal factors in binary data via a novel method of matrix decomposition
- Approximation algorithms for Hamming clustering problems
- Optimal decompositions of matrices with grades into binary and graded matrices
- Computational Advertising: Techniques for Targeting Relevant Ads
- Generalized Independent Component Analysis Over Finite Alphabets
- Randomized Algorithms for Matrices and Data
- Authoritative sources in a hyperlinked environment
- Polynomial-time approximation schemes for geometric min-sum median clustering
- On the closest string and substring problems
- SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS
- More Efficient Algorithms for Closest String and Substring Problems
- A Clustering Approach to Constrained Binary Matrix Factorization
- Using Linear Algebra for Intelligent Information Retrieval
- Low rank approximation with entrywise l 1 -norm error
- Parameterized Low-Rank Binary Matrix Approximation
- Foundations of Data Science
- On the Complexity of Robust PCA and ℓ1-Norm Low-Rank Matrix Approximation
- A PTAS for ℓp-Low Rank Approximation
- Independent Component Analysis Over Galois Fields of Prime Order
- Combinatorial Pattern Matching
- Lower Bounds for Approximation Schemes for Closest String
