Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis

DOI10.1145/1132973.1132976MaRDI QIDQ3549174zbMATH OpenOpenAlexWikidataFDO

Authors Mehmet Koyutürk, Naren Ramakrishnan, 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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Matrices of integers (15B36)

Recommendations

• Discovery of optimal factors in binary data via a novel method of matrix decomposition
• A clustering approach to constrained binary matrix factorization
• Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
• scientific article; zbMATH DE number 1934564
• Low rank approximation of binary matrices: column subset selection and generalizations

Cited in

(10)

• Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking
• The bipartite Boolean quadric polytope
• An integer approximation method for discrete sinusoidal transforms
• Integer matrix approximation and data mining
• The bipartite QUBO
• Semantic indexing in structured peer-to-peer networks
• Markov chain methods for the bipartite Boolean quadratic programming problem
• A clustering approach to constrained binary matrix factorization
• A divide-and-conquer algorithm for binary matrix completion
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549174)