fangs

A neighborhood-based, greedy search algorithm is performed to estimate a feature allocation by minimizing the expected loss based on posterior samples from the feature allocation distribution. The method is currently under peer review but an earlier draft is available in Dahl, Johnson, and Andros (2022+) doi:10.48550/arXiv.2207.13824.

Last 30 days

This package has been downloaded 328 times in the last 30 days. Enough downloads to make a small wave in the niche community. The curiosity is spreading! The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 6 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 91,369 times in the last 365 days. The kind of number that gets mentioned in a keynote speech. Well done! The day with the most downloads was Nov 01, 2024 with 12,353 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.