Installation
About
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)
Key Metrics
Downloads
Yesterday | 1 0% |
Last 7 days | 13 -62% |
Last 30 days | 127 -8% |
Last 90 days | 421 -7% |
Last 365 days | 1.869 +4% |
Maintainer
Maintainer | Abdelmoneim Amer Desouki |