Feature Allocation Neighborhood Greedy Search Algorithm R package fangs version 0.2.22 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>. Software Depends: R (>= 4.3.0) David B. Dahl <dahl@stat.byu.edu> Comprehensive R Archive Network (CRAN) 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) MIT + file LICENSE (https://CRAN.R-project.org/package=fangs/LICENSE) Apache License 2.0 2026-03-08 application/tgz https://CRAN.R-project.org/package=fangs doi:10.32614/CRAN.package.fangs