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