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)