Binary matrix factorization and completion via integer programming

DOI10.1287/MOOR.2023.1386MaRDI QIDQ6563035zbMATH OpenFDO

Authors Oktay Günlük, Raphael A. Hauser, Réka Ágnes Kovács

Publication date 27 June 2024

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/MOOR.2023.1386

zbMATH Keywords

binary matrix completionbinary matrix factorizationcolumn generationinteger programming

Mathematics Subject Classification ID

Integer programming (90C10) Applications of mathematical programming (90C90)

Recommendations

• A clustering approach to constrained binary matrix factorization
• Discovery of optimal factors in binary data via a novel method of matrix decomposition
• Low rank approximation of binary matrices: column subset selection and generalizations
• From-below approximations in Boolean matrix factorization: geometry and new algorithm
• Parameterized low-rank binary matrix approximation

This page was built for publication: Binary matrix factorization and completion via integer programming

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