Stat Comput. 2018;28(6):1169-1186. doi: 10.1007/s11222-017-9786-y. Epub 2017 Oct 31.
Statistics and computing
Riccardo Rastelli, Nial Friel
PMID: 30220822 PMCID: PMC6133164 DOI: 10.1007/s11222-017-9786-y
In cluster analysis interest lies in probabilistically capturing partitions of individuals, items or observations into groups, such that those belonging to the same group share similar attributes or relational profiles. Bayesian posterior samples for the latent allocation variables can be effectively obtained in a wide range of clustering models, including finite mixtures, infinite mixtures, hidden Markov models and block models for networks. However, due to the categorical nature of the clustering variables and the lack of scalable algorithms, summary tools that can interpret such samples are not available. We adopt a Bayesian decision theoretical approach to define an optimality criterion for clusterings and propose a fast and context-independent greedy algorithm to find the best allocations. One important facet of our approach is that the optimal number of groups is automatically selected, thereby solving the clustering and the model-choice problems at the same time. We consider several loss functions to compare partitions and show that our approach can accommodate a wide range of cases. Finally, we illustrate our approach on both artificial and real datasets for three different clustering models: Gaussian mixtures, stochastic block models and latent block models for networks.
Keywords: Bayesian clustering; Cluster analysis; Greedy optimisation; Latent variable models; Markov chain Monte Carlo
