  Probabilistic approach to Boolean matrix factorization can provide solutions
robustagainst noise and missing values with linear computational complexity.
However,the assumption about latent factors can be problematic in real world
applications.This study proposed a new probabilistic algorithm free of
assumptions of latentfactors, while retaining the advantages of previous
algorithms. Real data experimentshowed that our algorithm was favourably
compared with current state-of-the-artprobabilistic algorithms.
