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...
Główni autorzy: | Kovacs, RA, Gunluk, O, Hauser, R |
---|---|
Format: | Conference item |
Język: | English |
Wydane: |
Association for the Advancement of Artificial Intelligence
2021
|
Podobne zapisy
-
Binary matrix factorisation and completion via integer programming
od: Gunluk, O, i wsp.
Wydane: (2023) -
Binary matrix factorisations under Boolean arithmetic
od: Kovács, RA
Wydane: (2023) -
Low-rank Boolean matrix approximation by integer programming
od: Kovacs, R, i wsp.
Wydane: (2018) -
Pushing forward matrix factorisations
od: Dyckerhoff, T, i wsp.
Wydane: (2011) -
A factorisation-aware Matrix element emulator
od: D. Maître, i wsp.
Wydane: (2021-11-01)