A fast and efficient modal EM algorithm for Gaussian mixtures
From MaRDI portal
Cites work
- A nonparametric statistical approach to clustering via mode identification
- A Review on Modal Clustering
- Cluster Analysis
- Clustering methods based on kernel density estimators: mean shift algorithms
- Estimating the cluster tree of a density by analyzing the minimal spanning tree of a sample
- Finite mixture and Markov switching models.
- Finite mixture models
- Flexible mixture modeling via the multivariate t distribution with the Box-Cox transformation: an alternative to the skew-t distribution
- scientific article; zbMATH DE number 3579840 (Why is no real title available?)
- scientific article; zbMATH DE number 2090824 (Why is no real title available?)
- Identifying connected components in Gaussian finite mixture models for clustering
- Maximum number of modes of Gaussian mixtures
- Methods for merging Gaussian mixture components
- Mixture model modal clustering
- Model-Based Clustering, Discriminant Analysis, and Density Estimation
- Model-Based Gaussian and Non-Gaussian Clustering
- Projection Pursuit Based on Gaussian Mixtures and Evolutionary Algorithms
- The estimation of the gradient of a density function, with applications in pattern recognition
This page was built for publication: A fast and efficient modal EM algorithm for Gaussian mixtures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6914449)