Search Algorithms and Loss Functions for Bayesian Clustering R package salso version 0.3.78 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 (2022) <doi:10.1080/10618600.2022.2069779>. Software Depends: R (>= 4.3) David B. Dahl <dahl@stat.byu.edu> Comprehensive R Archive Network (CRAN) David B. Dahl [aut, cre] (ORCID: <https://orcid.org/0000-0002-8173-1547>), Devin J. Johnson [aut] (ORCID: <https://orcid.org/0000-0003-2619-6649>), Peter Müller [aut], Andrés Felipe Barrientos [aut], Garritt Page [aut], David Dunson [aut], Authors of the dependency Rust crates [ctb] (see inst/AUTHORS file for details) MIT + file LICENSE (https://CRAN.R-project.org/package=salso/LICENSE) Apache License 2.0 2026-04-16 application/tgz https://CRAN.R-project.org/package=salso doi:10.32614/CRAN.package.salso