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

Package details

AuthorAbdelmoneim Amer Desouki
MaintainerAbdelmoneim Amer Desouki <desouki@hhu.de>
LicenseGPL-3
Version1.1
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:
install.packages("rBMF")

Try the rBMF package in your browser

Any scripts or data that you put into this service are public.

rBMF documentation built on Jan. 16, 2021, 5:31 p.m.