fangs
Feature Allocation Neighborhood Greedy Search Algorithm
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.
- Version0.2.17
- R versionunknown
- LicenseMIT
- LicenseApache License 2.0
- Needs compilation?Yes
- Last release09/06/2024
Documentation
Team
David B. Dahl
R. Jacob Andros
Alex Crichton
Show author detailsRolesContributorBrendan Zabarauskas
Show author detailsRolesContributorDavid Tolnay
Show author detailsRolesContributorJim Turner
Show author detailsRolesContributorJosh Stone
Show author detailsRolesContributorR. Janis Goldschmidt
Show author detailsRolesContributorThe Cranelift Project Developers
Show author detailsRolesContributorThe CryptoCorrosion Contributors
Show author detailsRolesContributorThe Rand Project Developers
Show author detailsRolesContributorThe Rust Project Developers
Show author detailsRolesContributorUlrik Sverdrup "bluss"
Show author detailsRolesContributorbluss
Show author detailsRolesContributorDevin J. Johnson
Andrii Dmytrenko
Show author detailsRolesContributorNiko Matsakis
Show author detailsRolesContributor
Insights
Last 30 days
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
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN