Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis
From MaRDI portal
Publication:3549174
DOI10.1145/1132973.1132976zbMath1346.15028OpenAlexW2167851099WikidataQ113310699 ScholiaQ113310699MaRDI QIDQ3549174
Naren Ramakrishnan, Mehmet Koyutürk, Ananth Grama
Publication date: 21 December 2008
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1132973.1132976
Related Items (10)
The Bipartite QUBO ⋮ The bipartite Boolean quadric polytope ⋮ A divide-and-conquer algorithm for binary matrix completion ⋮ An integer approximation method for discrete sinusoidal transforms ⋮ Semantic indexing in structured peer-to-peer networks ⋮ Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking ⋮ A Clustering Approach to Constrained Binary Matrix Factorization ⋮ Integer matrix approximation and data mining ⋮ Markov chain methods for the bipartite Boolean quadratic programming problem ⋮ The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
This page was built for publication: Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis
