salso

swMATH40219CRANsalsoMaRDI QIDQ55919FDOQ55919

Search Algorithms and Loss Functions for Bayesian Clustering

Devin J. Johnson, Peter Müller, David B. Dahl

Last update: 17 July 2023

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

Software version identifier: 0.3.29, 0.1.2, 0.1.3, 0.1.9, 0.1.11, 0.1.16, 0.2.3, 0.2.5, 0.2.15, 0.2.20, 0.2.22, 0.2.23, 0.3.0, 0.3.27, 0.3.35

Source code repository: https://github.com/cran/salso

Description

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

Cites work

• Search Algorithms and Loss Functions for Bayesian Clustering

Cited In (5)

• SANple
• Discovering interactions using covariate informed random partition models
• intRinsic
• AntMAN
• mdir

This page was built for software: salso