Binary matrix factorisation via column generation
Identifying discrete patterns in binary data is an important dimensionality reduction tool in machine learning and data mining. In this paper, we consider the problem of low-rank binary matrix factorisation (BMF) under Boolean arithmetic. Due to the hardness of this problem, most previous attempts r...
| Автори: | , , |
|---|---|
| Формат: | Conference item |
| Мова: | English |
| Опубліковано: |
Association for the Advancement of Artificial Intelligence
2021
|