Model-based clustering based on sparse finite Gaussian mixtures
Open accessThe DOI matches its Crossref record; 56 of the 56 references it cites were found in a registry or an index.
Abstract
In the framework of Bayesian model-based clustering based on a finite mixture of Gaussian distributions, we present a joint approach to estimate the number of mixture components and identify cluster-relevant variables simultaneously as well as to obtain an identified model. Our approach consists in specifying sparse hierarchical priors on the mixture weights and component means. In a deliberately overfitting mixture model the sparse prior on the weights empties superfluous components during MCMC. A straightforward estimator for the true number of components is given by the most frequent number of non-empty components visited during MCMC sampling. Specifying a shrinkage prior, namely the normal gamma prior, on the component means leads to improved parameter estimates as well as identification of cluster-relevant variables. After estimating the mixture model using MCMC methods based on data augmentation and Gibbs sampling, an identified model is obtained by relabeling the MCMC output in the point process representation of the draws. This is performed using [Formula: see text]-centroids cluster analysis based on the Mahalanobis distance. We evaluate our proposed strategy in a simulation setup with artificial data and by applying it to benchmark data sets.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Modern Applied Statistics with S
Venables, W. N., & Ripley, B. D. (2002) · Statistics and Computing · doi:10.1007/978-0-387-21706-2 · Cited by 24,305
THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS
FISHER, R. A. (1936) · Annals of Eugenics · doi:10.1111/j.1469-1809.1936.tb02137.x · Cited by 15,227 · cited 1×
“The Iris data set (Anderson 1935; Fisher 1936) consists of 50 samples from each of three species of Iris, namely Iris setosa, Iris virginica and Iris versicolor.”
MethodMcLachlan, G., & Peel, D. (2000) · Wiley Series in Probability and Statistics · doi:10.1002/0471721182 · Cited by 10,991
Finding groups in data: an introduction to cluster analysis
(1991) · Choice Reviews Online · doi:10.5860/choice.28-4558 · Cited by 10,474
Finding Groups in Data: An Introduction to Cluster Analysis
Kaufman, L., & Rousseeuw, P. J. (1990) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316801 · Cited by 7,344 · cited 1×
“…et al. (2013) define a Dirichlet process prior on the mixture weights and cluster the pairwise association matrix, which is obtained by aggregating over all partitions obtained during Markov chain Monte Carlo (MCMC) sampling, using partitioning around medoids (PAM; Kaufman and Rousseeuw 1990).”
MethodPark, T., & Casella, G. (2008) · Journal of the American Statistical Association · doi:10.1198/016214508000000337 · Cited by 2,934 · cited 2×
“This could be developed similar to the automatic approaches which are for example used for explicit variable selection in a regression setting when using the Bayesian Lasso.”
BackgroundModel-Based Gaussian and Non-Gaussian Clustering
Banfield, J. D., & Raftery, A. E. (1993) · Biometrics · doi:10.2307/2532201 · Cited by 2,395 · cited 2×
“Since the pioneering papers by Banfield and Raftery (1993), Bensmail et al. (1997) and Dasgupta and Raftery (1998), model-based clustering based on finite mixtures has”
BackgroundOn Bayesian Analysis of Mixtures with an Unknown Number of Components (with discussion)
Richardson, S., & Green, P. J. (1997) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00095 · Cited by 1,898 · cited 2×
“Within finite mixtures, a fully Bayesian approach toward selecting K is often based on reversible jump Markov chain Monte Carlo (RJMCMC), as introduced by Richardson and Green (1997).”
Krämer, W. (2003) · Computational Statistics & Data Analysis · Cited by 1,858
Finite Mixture and Markov Switching Models
(2006) · Springer Series in Statistics · doi:10.1007/978-0-387-35768-3 · Cited by 1,554 · cited 5×
“Estimation of the sparse finite mixture model is performed through MCMC sampling based on data augmentation and Gibbs sampling (Diebolt and Robert 1994; Frühwirth-Schnatter 2006, chap.”
BackgroundMethodInfluential
Cited by
An Approach for Determining the Number of Clusters in a Model-Based Cluster Analysis
Akogul, S., & Erisoglu, M. (2017) · Entropy · doi:10.3390/e19090452 · Cited by 269
Predicting Upper Limb Motor Impairment Recovery after Stroke: A Mixture Model
van der Vliet, R., Selles, R. W., Andrinopoulou, E., Nijland, R., Ribbers, G. M., Frens, M. A., Meskers, C., & Kwakkel, G. (2020) · Annals of Neurology · doi:10.1002/ana.25679 · Cited by 229
Li, Z., & Zhou, X. (2022) · Genome Biology · doi:10.1186/s13059-022-02734-7 · Cited by 176
“In particular, we specify a normal-gamma prior for μj [69], an inverseWishart prior for Σ, and a Dirichlet distribution for πr (details in the Additional file 1: Supplementary notes).”
MethodStergiou, K., Ntakolia, C., Varytis, P., Koumoulos, E., Karlsson, P., & Moustakidis, S. (2023) · Computational Materials Science · doi:10.1016/j.commatsci.2023.112031 · Cited by 161
Metadata
- Authors
- Malsiner-Walli, G., Frühwirth-Schnatter, S., & Grün, B.
- Venue
- Statistics and Computing
- Published
- 2014-08-26
- Volume
- 26
- Issue
- 1-2
- Pages
- 303-324
- ISSN
- 0960-3174 (ISSN-L)
- 1573-1375
- OpenAlex
- W2075657928
- Cited by
- 173
- References
- 56
- FWCI
- 4.62
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.