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...
Autori principali: | Kovacs, RA, Gunluk, O, Hauser, R |
---|---|
Natura: | Conference item |
Lingua: | English |
Pubblicazione: |
Association for the Advancement of Artificial Intelligence
2021
|
Documenti analoghi
Documenti analoghi
-
Binary matrix factorisation and completion via integer programming
di: Gunluk, O, et al.
Pubblicazione: (2023) -
Binary matrix factorisations under Boolean arithmetic
di: Kovács, RA
Pubblicazione: (2023) -
Low-rank Boolean matrix approximation by integer programming
di: Kovacs, R, et al.
Pubblicazione: (2018) -
Pushing forward matrix factorisations
di: Dyckerhoff, T, et al.
Pubblicazione: (2011) -
Rail transit OD‐matrix completion via manifold regularized tensor factorisation
di: Hanxuan Dong, et al.
Pubblicazione: (2021-10-01)