.png){kind=icon}
.png){kind=icon}
Return
Boolean decomposition of binary matrices using a post-nonlinear mixture approach
.png){kind=icon}
OA
AI
DOI：10.1016/j.sigpro.2020.107809.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We introduce a novel binary matrix factorization (BMF) approach based on a post-nonlinear mixture model. Unlike the existing BMF methods, which are based on the classical matrix product, the proposed mixture model is equivalent to the Boolean matrix factorization model when the entries of the factor matrices are exactly binary. Consequently, our approach yields interpretable results in the case of overlapping sources and more accurate low-rank binary matrix approximations compared to the state-of-the-art. We propose a simple yet efficient algorithm for solving the proposed BMF problem based on multiplicative update rules. In addition, we provide for the first time in the binary data literature, a necessary and sufficient condition for the uniqueness of the Boolean matrix factorization, as well as several other uniqueness results. The interest of this new approach is illustrated in numerical simulation and on real datasets. (C) 2020 Elsevier B.V. All rights reserved.
Keywords:
Binary source separation
Boolean factorization
Post-nonlinear mixture
Boolean rank
Uniqueness
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.