Studying Complexity of Model-based Clustering
From MaRDI portal
Recommendations
- Model-based clustering
- Model-based clustering
- An experimental comparison of model-based clustering methods
- On the complexity of additive clustering models
- scientific article; zbMATH DE number 4034897
- Probabilistic assessment of model-based clustering
- 10.1162/1532443041827943
- On the complexity of some cluster analysis problems
- Model-based clustering for random hypergraphs
- Clustering models
Cites work
- A mixture of experts model for rank data with applications in election studies
- Choosing starting values for the EM algorithm for getting the highest likelihood in multivariate Gaussian mixture models
- Comparing clusterings -- an information based distance
- Estimating the dimension of a model
- Finding Groups in Data
- Generation of random clusters with specified degree of separation
- How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis
- Initializing the EM algorithm in Gaussian mixture models with an unknown number of components
- Model-Based Clustering, Discriminant Analysis, and Density Estimation
- Model-based clustering of high-dimensional data: a review
- OCLUS: an analytic method for generating clusters with known overlap
- Separation index and partial membership for clustering
- Variable Selection for Model-Based Clustering
Cited in
(5)- Regarding the complexity of additive clustering models: comment on Lee (2001).
- An experimental comparison of model-based clustering methods
- scientific article; zbMATH DE number 907937 (Why is no real title available?)
- Clustering large datasets by merging \(K\)-means solutions
- An effective strategy for initializing the EM algorithm in finite mixture models
This page was built for publication: Studying Complexity of Model-based Clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2816737)
