.png){kind=icon}
返回
Parallel exploration of partial solutions in Boolean matrix factorization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2018.09.014.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Boolean matrix factorization (BMF) is a well established method for preprocessing and analysis of data. There is a number of algorithms for BMF, but none of them uses benefits of parallelization. This is mainly due to the fact that many of the algorithms utilize greedy heuristics that are inherently sequential. In this work, we propose a general parallelization scheme for BMF in which several locally optimal partial matrix decompositions are constructed simultaneously in parallel, instead of just one in a sequential algorithm. As a result of the computation, either the single best final decomposition or several top-k of them may be returned. The scheme can be applied to any sequential heuristic BMF algorithm and we show the application on two representative algorithms, namely GRECoND and Asso. Improvements in decompositions are presented via results from experiments with the new algorithms on synthetic and real datasets. (C) 2018 Elsevier Inc. All rights reserved. .
Keyword:
Boolean matrix factorization
Parallel algorithm
Data preprocessing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
.png){kind=icon}
没有更多内容
没有更多内容