Dealing with label switching in mixture models under genuine multimodality
From MaRDI portal
Publication:1006666
DOI10.1016/j.jmva.2008.09.006zbMath1157.62040OpenAlexW2088524402WikidataQ55861431 ScholiaQ55861431MaRDI QIDQ1006666
Friedrich Leisch, Bettina Grün
Publication date: 25 March 2009
Published in: Journal of Multivariate Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmva.2008.09.006
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Bayesian inference (62F15) Statistical astronomy (85A35)
Related Items
Bayesian Mixture Labeling and Clustering, Label switching and its solutions for frequentist mixture models, Online Bayesian learning for mixtures of spatial spline regressions with mixed effects, Robust fitting of mixtures of factor analyzers using the trimmed likelihood estimator, Model-based clustering based on sparse finite Gaussian mixtures, A Simple Solution to Bayesian Mixture Labeling, Bayesian analysis of static and dynamic factor models: an ex-post approach towards the rotation problem, Model based labeling for mixture models, An online Bayesian mixture labelling method by minimizing deviance of classification probabilities to reference labels, The class of \textsc{cub} models: statistical foundations, inferential issues and empirical evidence, Relabelling algorithms for mixture models with applications for large data sets
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Estimating the Number of Clusters in a Data Set Via the Gap Statistic
- Bayesian thinking, modeling and computation.
- A toolbox for \(K\)-centroids cluster analysis
- On the number of clusters
- Nonparametric testing of the existence of modes
- Identifiability of models for clusterwise linear regression
- Markov chain Monte Carlo methods and the label switching problem in Bayesian mixture modeling
- Finite mixture and Markov switching models.
- A variable-selection heuristic for K-means clustering
- Mixture Densities, Maximum Likelihood and the EM Algorithm
- Finding Groups in Data
- Dealing With Label Switching in Mixture Models
- Clustering Objects on Subsets of Attributes (with Discussion)
- Identifiability of Finite Mixtures
- On Information and Sufficiency