rBMF: 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) <doi.org/doi.org/10.1109/TKDE.2008.53>, 'GreConD' R. Belohlavek, V. Vychodil (2010) <doi.org/10.1016/j.jcss.2009.05.002> , 'GreConDPlus' R. Belohlavek, V. Vychodil (2010) <doi.org/10.1016/j.jcss.2009.05.002> , 'topFiberM' A. Desouki, M. Roeder, A. Ngonga (2019) <arXiv:1903.10326>.

Version: 1.0
Depends: R (≥ 3.2.0), Matrix, methods, Rcpp
Published: 2020-06-25
Author: Abdelmoneim Amer Desouki
Maintainer: Abdelmoneim Amer Desouki <desouki at mail.upb.de>
License: GPL-3
NeedsCompilation: no
Materials: NEWS
CRAN checks: rBMF results


Reference manual: rBMF.pdf
Package source: rBMF_1.0.tar.gz
Windows binaries: r-devel: rBMF_1.0.zip, r-release: rBMF_1.0.zip, r-oldrel: rBMF_1.0.zip
macOS binaries: r-release: rBMF_1.0.tgz, r-oldrel: rBMF_1.0.tgz


Please use the canonical form https://CRAN.R-project.org/package=rBMF to link to this page.