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