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>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
1.1 |
rolling linux/jammy R-4.5 | rBMF_1.1.tar.gz |
76.1 KiB |
1.1 |
rolling linux/noble R-4.5 | rBMF_1.1.tar.gz |
76.0 KiB |
1.1 |
rolling source/ R- | rBMF_1.1.tar.gz |
41.2 KiB |
1.1 |
latest linux/jammy R-4.5 | rBMF_1.1.tar.gz |
76.1 KiB |
1.1 |
latest linux/noble R-4.5 | rBMF_1.1.tar.gz |
76.0 KiB |
1.1 |
latest source/ R- | rBMF_1.1.tar.gz |
41.2 KiB |
1.1 |
2026-04-26 source/ R- | rBMF_1.1.tar.gz |
41.2 KiB |
1.1 |
2026-04-23 source/ R- | rBMF_1.1.tar.gz |
41.2 KiB |
1.1 |
2026-04-09 windows/windows R-4.5 | rBMF_1.1.zip |
78.9 KiB |
1.1 |
2025-04-20 source/ R- | rBMF_1.1.tar.gz |
41.2 KiB |