rBMF

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.

Last 30 days

This package has been downloaded 129 times in the last 30 days. More than a random curiosity, but not quite a blockbuster. Still, it's gaining traction! The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 2 times.

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

Last 365 days

This package has been downloaded 1,706 times in the last 365 days. That's enough downloads to impress a room full of undergrads. A commendable achievement indeed. The day with the most downloads was Sep 11, 2024 with 23 downloads.

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