Boolean matrix factorization with background knowledge

作者:

Highlights:

摘要

Boolean matrix factorization (BMF) is a popular data analysis method summarizing the input data by Boolean factors. The Boolean nature ensures an easy interpretation of a particular factor, however, the interpretation of all discovered factors (as a whole) by domain experts may be difficult as the BMF methods seek only information in the data and do not reflect the experts understanding of data. In the paper, we propose a formalization of a novel variant of BMF reflecting expert’s background knowledge—additional knowledge about the data—that is not part of the data, in the form of attribute weights, as well as an algorithm for it. Moreover, we show that the proposed algorithm, which significantly outperforms the state-of-the-art algorithm, provides encouraging results that are worth further investigation.

论文关键词:Boolean matrix factorization,Background knowledge,Data analysis

论文评审过程:Received 22 September 2021, Revised 18 January 2022, Accepted 19 January 2022, Available online 25 January 2022, Version of Record 8 February 2022.

论文官网地址:https://doi.org/10.1016/j.knosys.2022.108261