Nothing
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 described in Dahl, Johnson, and Andros (2023) "Comparison and Bayesian Estimation of Feature Allocations" <doi:10.1080/10618600.2023.2204136>.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | David B. Dahl [aut, cre] (ORCID: <https://orcid.org/0000-0002-8173-1547>), R. Jacob Andros [aut] (ORCID: <https://orcid.org/0000-0002-1289-385X>), Devin J. Johnson [aut] (ORCID: <https://orcid.org/0000-0003-2619-6649>), Authors of the dependency Rust crates [ctb] (see inst/AUTHORS file for details) |
| Maintainer | David B. Dahl <dahl@stat.byu.edu> |
| License | MIT + file LICENSE | Apache License 2.0 |
| Version | 0.2.22 |
| URL | https://github.com/dbdahl/fangs-package |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the fangs package in your browser
Any scripts or data that you put into this service are public.
