Learn R Programming

⚠️There's a newer version (0.3.53) of this package.Take me there.

salso (version 0.2.5)

Search Algorithms and Loss Functions for Bayesian Clustering

Description

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

Copy Link

Version

Install

install.packages('salso')

Monthly Downloads

848

Version

0.2.5

License

MIT + file LICENSE | Apache License 2.0

Maintainer

David B Dahl

Last Published

November 19th, 2020

Functions in salso (0.2.5)

dlso

Latent Structure Optimization Based on Draws
bell

Compute the Bell Number
psm

Compute an Adjacency or Pairwise Similarity Matrix
enumerate.permutations

Enumerate Permutations of Items
enumerate.partitions

Enumerate Partitions of a Set
salso

SALSO Greedy Search
iris.clusterings

Clusterings of the Iris Data
confidence

Compute Clustering Confidence
partition.loss

Compute Partition Loss or the Expectation of Partition Loss
summary.salso.estimate

Summary of Partitions Estimated Using Posterior Expected Loss
plot.salso.summary

Heatmap, Multidimensional Scaling, Pairs, and Dendrogram Plotting for Partition Estimation