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>.

Version: 0.2.22
Depends: R (≥ 4.3.0)
Published: 2026-03-08
DOI: 10.32614/CRAN.package.fangs
Author: David B. Dahl ORCID iD [aut, cre], R. Jacob Andros ORCID iD [aut], Devin J. Johnson ORCID iD [aut], Authors of the dependency Rust crates [ctb] (see inst/AUTHORS file for details)
fangs author details
Maintainer: David B. Dahl <dahl at stat.byu.edu>
BugReports: https://github.com/dbdahl/fangs-package/issues
License: MIT + file LICENSE | Apache License 2.0
URL: https://github.com/dbdahl/fangs-package
NeedsCompilation: yes
SystemRequirements: Cargo (Rust's package manager), rustc
Materials: NEWS, INSTALL
CRAN checks: fangs results

Documentation:

Reference manual: fangs.html , fangs.pdf

Downloads:

Package source: fangs_0.2.22.tar.gz
Windows binaries: r-devel: fangs_0.2.21.zip, r-release: fangs_0.2.21.zip, r-oldrel: fangs_0.2.22.zip
macOS binaries: r-release (arm64): fangs_0.2.22.tgz, r-oldrel (arm64): fangs_0.2.22.tgz, r-release (x86_64): fangs_0.2.21.tgz, r-oldrel (x86_64): fangs_0.2.21.tgz
Old sources: fangs archive

Linking:

Please use the canonical form https://CRAN.R-project.org/package=fangs to link to this page.