rBMF

Boolean Matrix Factorization

CRAN Package

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) doi:10.48550/arXiv.1903.10326.

  • Version1.1
  • R version≥ 3.2.0
  • LicenseGPL-3
  • Needs compilation?No
  • Last release01/13/2021

Documentation


Team


Insights

Last 30 days

Last 365 days

The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.

Data provided by CRAN


Binaries


Dependencies

  • Depends2 packages