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] (<https://orcid.org/0000-0002-8173-1547>), R. Jacob Andros [aut] (<https://orcid.org/0000-0002-1289-385X>), Devin J. Johnson [aut] (<https://orcid.org/0000-0003-2619-6649>), Alex Crichton [ctb] (Rust crates: cfg-if, proc-macro2), Andrii Dmytrenko [ctb] (Rust crate: lapjv), Brendan Zabarauskas [ctb] (Rust crate: approx), David B. Dahl [ctb] (Rust crates: roxido, roxido_macro), David Tolnay [ctb] (Rust crates: proc-macro2, quote, syn, unicode-ident), Jim Turner [ctb] (Rust crate: ndarray), Josh Stone [ctb] (Rust crates: autocfg, rayon, rayon-core), Niko Matsakis [ctb] (Rust crates: rayon, rayon-core), R. Janis Goldschmidt [ctb] (Rust crate: matrixmultiply), The Cranelift Project Developers [ctb] (Rust crate: wasi), The CryptoCorrosion Contributors [ctb] (Rust crates: ppv-lite86, rand_chacha), The Rand Project Developers [ctb] (Rust crates: getrandom, rand, rand_chacha, rand_core, rand_pcg), The Rust Project Developers [ctb] (Rust crates: libc, log, num-complex, num-integer, num-traits, rand, rand_chacha, rand_core), Ulrik Sverdrup "bluss" [ctb] (Rust crate: ndarray), bluss [ctb] (Rust crates: either, itertools, matrixmultiply, rawpointer) |
| Maintainer | David B. Dahl <dahl@stat.byu.edu> |
| License | MIT + file LICENSE | Apache License 2.0 |
| Version | 0.2.21 |
| 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.
