FBFsearch

We propose an objective Bayesian algorithm for searching the space of Gaussian directed acyclic graph (DAG) models. The algorithm proposed makes use of moment fractional Bayes factors (MFBF) and thus it is suitable for learning sparse graph. The algorithm is implemented by using Armadillo: an open-source C++ linear algebra library.

Last 30 days

This package has been downloaded 183 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 7 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 2,813 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 31 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.