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>.
Version: | 0.2.17 |
Depends: | R (≥ 4.2.0) |
Published: | 2024-09-06 |
DOI: | 10.32614/CRAN.package.fangs |
Author: | David B. Dahl fangs author details |
Maintainer: | David B. Dahl <dahl at stat.byu.edu> |
BugReports: | https://github.com/dbdahl/fangs/issues |
License: | MIT + file LICENSE | Apache License 2.0 |
URL: | https://github.com/dbdahl/fangs |
NeedsCompilation: | yes |
SystemRequirements: | Cargo (Rust's package manager), rustc (>= 1.66.1) |
Materials: | NEWS INSTALL |
CRAN checks: | fangs results |
Reference manual: | fangs.pdf |
Package source: | fangs_0.2.17.tar.gz |
Windows binaries: | r-devel: fangs_0.2.17.zip, r-release: fangs_0.2.17.zip, r-oldrel: fangs_0.2.17.zip |
macOS binaries: | r-release (arm64): fangs_0.2.17.tgz, r-oldrel (arm64): fangs_0.2.17.tgz, r-release (x86_64): fangs_0.2.17.tgz, r-oldrel (x86_64): fangs_0.2.17.tgz |
Old sources: | fangs archive |
Please use the canonical form https://CRAN.R-project.org/package=fangs to link to this page.