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...
Κύριοι συγγραφείς: | Kovacs, RA, Gunluk, O, Hauser, R |
---|---|
Μορφή: | Conference item |
Γλώσσα: | English |
Έκδοση: |
Association for the Advancement of Artificial Intelligence
2021
|
Παρόμοια τεκμήρια
-
Binary matrix factorisation and completion via integer programming
ανά: Gunluk, O, κ.ά.
Έκδοση: (2023) -
Binary matrix factorisations under Boolean arithmetic
ανά: Kovács, RA
Έκδοση: (2023) -
Low-rank Boolean matrix approximation by integer programming
ανά: Kovacs, R, κ.ά.
Έκδοση: (2018) -
Pushing forward matrix factorisations
ανά: Dyckerhoff, T, κ.ά.
Έκδοση: (2011) -
Rail transit OD‐matrix completion via manifold regularized tensor factorisation
ανά: Hanxuan Dong, κ.ά.
Έκδοση: (2021-10-01)