.png){kind=icon}
返回
Boolean matrix factorization for symmetric binary variables
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2023.110944.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Binary variables classify into two types: asymmetric variables, where one state (1 or 0) is significantly more valuable than the other, and symmetric variables, where both states are equally valuable. Boolean matrix factorization (BMF), a popular methodology of preprocessing and analyzing tabular binary data, handles its input as asymmetric variables. In the paper, we develop an alternative that handles Boolean matrices as symmetric variables. Our method differs from traditional BMF in that the factors are linearly ordered by priority, and factors can contradict each other, meaning that one factor can assign a value of 1 while the other assigns a value of 0. In such a case, the factor with higher priority is the relevant one. Through experiments, we demonstrate that our approach provides a more compact data description than a straightforward application of the traditional BMF methods. Moreover, it is even able to overcome the Schein rank. (c) 2023 Elsevier B.V. All rights reserved.
Keyword:
Decomposition
Boolean data
Symmetric attribute
Formal concept
期刊
K
IF:
7.6
论文数:
1.2W
被引数:
4.5W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容