salso: Search Algorithms and Loss Functions for Bayesian Clustering

The SALSO algorithm is an efficient randomized greedy search method to find a point estimate for a random partition based on a loss function and posterior Monte Carlo samples. 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. See Dahl, Johnson, Müller (2021) <arXiv:2105.04451>.

Version: 0.3.0
Depends: R (≥ 4.0.0)
Published: 2021-12-06
Author: David B. Dahl ORCID iD [aut, cre], Devin J. Johnson ORCID iD [aut], Peter Müller [aut]
Maintainer: David B. Dahl <dahl at>
License: MIT + file LICENSE | Apache License 2.0
NeedsCompilation: yes
SystemRequirements: Cargo (>= 1.51.0) for installation from sources: see INSTALL file
CRAN checks: salso results


Reference manual: salso.pdf


Package source: salso_0.3.0.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
macOS binaries: r-release (arm64): salso_0.3.0.tgz, r-oldrel (arm64): salso_0.3.0.tgz, r-release (x86_64): salso_0.3.0.tgz, r-oldrel (x86_64): salso_0.3.0.tgz
Old sources: salso archive

Reverse dependencies:

Reverse imports: AntMAN, intRinsic
Reverse suggests: caviarpd


Please use the canonical form to link to this page.