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