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...
Príomhchruthaitheoirí: | Kovacs, RA, Gunluk, O, Hauser, R |
---|---|
Formáid: | Conference item |
Teanga: | English |
Foilsithe / Cruthaithe: |
Association for the Advancement of Artificial Intelligence
2021
|
Míreanna comhchosúla
Míreanna comhchosúla
-
Binary matrix factorisation and completion via integer programming
de réir: Gunluk, O, et al.
Foilsithe / Cruthaithe: (2023) -
Binary matrix factorisations under Boolean arithmetic
de réir: Kovács, RA
Foilsithe / Cruthaithe: (2023) -
Low-rank Boolean matrix approximation by integer programming
de réir: Kovacs, R, et al.
Foilsithe / Cruthaithe: (2018) -
Pushing forward matrix factorisations
de réir: Dyckerhoff, T, et al.
Foilsithe / Cruthaithe: (2011) -
Rail transit OD‐matrix completion via manifold regularized tensor factorisation
de réir: Hanxuan Dong, et al.
Foilsithe / Cruthaithe: (2021-10-01)