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)