dahl-salso

Crates.iodahl-salso
lib.rsdahl-salso
version0.6.6
sourcesrc
created_at2019-08-22 22:26:57.193611
updated_at2021-11-22 16:57:03.960148
descriptionThe SALSO algorithm is an efficient greedy search procedure to obtain a clustering estimate based on a partition loss function. The algorithm is implemented for many loss functions, including the Binder loss and a generalization of the variation of information loss, both of which allow for unequal weights on the two types of clustering mistakes. Efficient implementations are also provided for Monte Carlo estimation of the posterior expected loss of a given clustering estimate. SALSO was first presented at the workshop 'Bayesian Nonparametric Inference: Dependence Structures and their Applications' in Oaxaca, Mexico on December 6, 2017.
homepagehttps://dahl.byu.edu
repository
max_upload_size
id159000
size99,906
David B. Dahl (dbdahl)

documentation

README

Commit count: 0

cargo fmt