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...
Hauptverfasser: | Kovacs, RA, Gunluk, O, Hauser, R |
---|---|
Format: | Conference item |
Sprache: | English |
Veröffentlicht: |
Association for the Advancement of Artificial Intelligence
2021
|
Ähnliche Einträge
Ähnliche Einträge
-
Binary matrix factorisation and completion via integer programming
von: Gunluk, O, et al.
Veröffentlicht: (2023) -
Binary matrix factorisations under Boolean arithmetic
von: Kovács, RA
Veröffentlicht: (2023) -
Low-rank Boolean matrix approximation by integer programming
von: Kovacs, R, et al.
Veröffentlicht: (2018) -
Pushing forward matrix factorisations
von: Dyckerhoff, T, et al.
Veröffentlicht: (2011) -
Rail transit OD‐matrix completion via manifold regularized tensor factorisation
von: Hanxuan Dong, et al.
Veröffentlicht: (2021-10-01)