期刊
JOURNAL OF COMPUTER AND SYSTEM SCIENCES
卷 81, 期 8, 页码 1678-1697出版社
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.jcss.2015.06.002
关键词
Boolean matrix; Matrix decomposition; Closure structures; Concept lattice; Approximation algorithm
资金
- Czech Science Foundation [GA15-17899S]
- IGA of Palacky University [PrF 2014034]
- [P202/10/0262]
We present new results on Boolean matrix factorization and a new algorithm based on these results. The results emphasize the significance of factorizations that provide from-below approximations of the input matrix. While the previously proposed algorithms do not consider the possibly different significance of different matrix entries, our results help measure such significance and suggest where to focus when computing factors. An experimental evaluation of the new algorithm on both synthetic and real data demonstrates its good performance in terms of good coverage by the first few factors as well as a small number of factors needed for an almost exact decomposition and indicates that the algorithm outperforms the available ones in these terms. We also propose future research topics. (C) 2015 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据