A generalized approach for Boolean matrix factorization

•A unified approach to Boolean matrix factorization is introduced in this paper•The approach allows combining rank-1 binary terms with arbitrary Boolean functions•The proposed method relies on a polynomial representation of the combining function•Two factorization algorithms are proposed based on on this representation•Comparisons with state-of-the art methods and tests on real data are presented