Boolean Matrix Factorization

Provides four boolean matrix factorization (BMF) methods. BMF has many applications like data mining and categorical data analysis. BMF is also known as boolean matrix decomposition (BMD) and was found to be an NP-hard (non-deterministic polynomial-time) problem. Currently implemented methods are 'Asso' Miettinen, Pauli and others (2008) , 'GreConD' R. Belohlavek, V. Vychodil (2010) , 'GreConDPlus' R. Belohlavek, V. Vychodil (2010) , 'topFiberM' A. Desouki, M. Roeder, A. Ngonga (2019) .


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


1.1 by Abdelmoneim Amer Desouki, 9 months ago

Browse source code at

Authors: Abdelmoneim Amer Desouki

Documentation:   PDF Manual  

GPL-3 license

Depends on Matrix, methods, Rcpp

See at CRAN