Learn R Programming

fangs (version 0.2.21)

Feature Allocation Neighborhood Greedy Search Algorithm

Description

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

Copy Link

Version

Install

install.packages('fangs')

Monthly Downloads

11,971

Version

0.2.21

License

MIT + file LICENSE | Apache License 2.0

Issues

Pull Requests

Stars

Forks

Maintainer

David B Dahl

Last Published

April 11th, 2025

Functions in fangs (0.2.21)

compute_expected_loss

Estimate the expected FARO Loss for a Feature Allocation
compute_loss

Compute the FARO Loss Between Feature Allocations
fangs-package

fangs: Feature Allocation Neighborhood Greedy Search Algorithm
fangs

Feature Allocation Neighborhood Greedy Search
samplesFA

Samples from the Attraction Indian Buffet Distribution