Model-Based Clustering of Categorical Data Based on the Hamming Distance
From MaRDI portal
Cites work
- A Mathematical Theory of Communication
- Asymptotic behaviour of the posterior distribution in overfitted mixture models
- Clustering Categorical Data Based on Distance Vectors
- Clustering criteria for discrete data and latent class models
- Clustering longitudinal life-course sequences using mixtures of exponential-distance models
- Consistency of mixture models with a prior on the number of components
- Error detecting and error correcting codes
- Estimating the dimension of a model
- Exchangeable and partially exchangeable random partitions
- Exploratory latent structure analysis using both identifiable and unidentifiable models
- From here to infinity: sparse finite versus Dirichlet process mixtures in model-based clustering
- Generalized mixtures of finite mixtures and telescoping sampling
- scientific article; zbMATH DE number 3942813 (Why is no real title available?)
- scientific article; zbMATH DE number 6107964 (Why is no real title available?)
- scientific article; zbMATH DE number 1832191 (Why is no real title available?)
- scientific article; zbMATH DE number 774881 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- scientific article; zbMATH DE number 3063387 (Why is no real title available?)
- Identifiability of Finite Mixtures
- Identifiability of parameters in latent structure models with many observed variables
- Is infinity that far? A Bayesian nonparametric perspective of finite mixture models
- Mixture modelling of high-dimensional data
- Mixture models with a prior on the number of components
- Mixture of latent trait analyzers for model-based clustering of categorical data
- Model-based clustering based on sparse finite Gaussian mixtures
- Model-based clustering for conditionally correlated categorical data
- On a class of Bayesian nonparametric estimates: I. Density estimates
- On the Identifiability of Finite Mixtures
- On the posterior distribution of the number of components in a finite mixture
- Predicting Successful and Unsuccessful Transitions from School to Work by Using Sequence Methods
- Random continued fractions with beta-hypergeometric distribution
- Retrospective Markov chain Monte Carlo methods for Dirichlet process hierarchical models
- Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
- Robust Bayesian inference via coarsening
- Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
- Slice sampling mixture models
- Some further developments for stick-breaking priors: finite and infinite clustering and classifica\-tion
- Table of integrals, series, and products. Translated from the Russian. Translation edited and with a preface by Alan Jeffrey and Daniel Zwillinger. With one CD-ROM (Windows, Macintosh and UNIX)
This page was built for publication: Model-Based Clustering of Categorical Data Based on the Hamming Distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6970783)
