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