fangs

Feature Allocation Neighborhood Greedy Search Algorithm

R. Jacob Andros, David B. Dahl, Devin J. Johnson

Last update: 17 July 2023

Copyright license: MIT license, File License, Apache License, Version 2.0

Software version identifier: 0.2.11, 0.2.2, 0.2.8, 0.2.13

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 currently under peer review but an earlier draft is available in Dahl, Johnson, and Andros (2022+) <doi:10.48550/arXiv.2207.13824>.

Cites work

Comparison and Bayesian Estimation of Feature Allocations

This page was built for software: fangs