# Boolean matrix factorization

Topic (help)
Boolean matrix factorization
Abbreviations: BMF DBP
Variations:
Category: Boolean matrix factorization
Parents:
Children:
Databases:
Search
Papers: DOAJ Google Scholar PubMed (Open J-Gate)
Ontologies: MeSH NeuroLex Wikidata Wikipedia

Boolean matrix factorization is a form of matrix factorization with Boolean matrix multiplications and is also referred to as discrete basis problem. The form can be written as:[1]

$\mathbf{X \approx W \otimes H}$

where all three matrices are binary matrices and the "multiplication" between W and H is a Boolean operation.

It is related to binary matrix factorization.

##  References

1. Pauli Miettinen, Taneli Mielikäinen, Aristides Gionis, Gautam Das, Meikki Mannila (2008). "The discrete basis problem". IEEE Transactions on Knowledge and Data Engineering 20(10): missing pages.