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


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.

install.packages("fangs")

0.2.25 by David B. Dahl, 20 days ago


https://github.com/dbdahl/fangs-package


Report a bug at https://github.com/dbdahl/fangs-package/issues


Browse source code at https://github.com/cran/fangs


Authors: David B. Dahl [aut, cre] (ORCID: , R. Jacob Andros [aut] , Devin J. Johnson [aut] , Authors of the dependency Rust crates [ctb] (see inst/AUTHORS file for details)


Documentation:   PDF Manual  


MIT + file LICENSE | Apache License 2.0 license


System requirements: Cargo (Rust's package manager), rustc (>= 1.85.1)


See at CRAN