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...
Principais autores: | Kovacs, RA, Gunluk, O, Hauser, R |
---|---|
Formato: | Conference item |
Idioma: | English |
Publicado em: |
Association for the Advancement of Artificial Intelligence
2021
|
Registros relacionados
-
Binary matrix factorisation and completion via integer programming
por: Gunluk, O, et al.
Publicado em: (2023) -
Binary matrix factorisations under Boolean arithmetic
por: Kovács, RA
Publicado em: (2023) -
Low-rank Boolean matrix approximation by integer programming
por: Kovacs, R, et al.
Publicado em: (2018) -
Pushing forward matrix factorisations
por: Dyckerhoff, T, et al.
Publicado em: (2011) -
A factorisation-aware Matrix element emulator
por: D. Maître, et al.
Publicado em: (2021-11-01)