Binary matrix factorisation and completion via integer programming
Binary matrix factorisation is an essential tool for identifying discrete patterns in binary data. In this paper we consider the rank-k binary matrix factorisation problem (k-BMF) under Boolean arithmetic: we are given an n × m binary matrix X with possibly missing entries and need to find two binar...
| 主要な著者: | , , |
|---|---|
| フォーマット: | Journal article |
| 言語: | English |
| 出版事項: |
INFORMS
2023
|