Mixture model modal clustering

@article{Chacn2019MixtureMM,
  title={Mixture model modal clustering},
  author={Jos{\'e} E. Chac{\'o}n},
  journal={Advances in Data Analysis and Classification},
  year={2019},
  volume={13},
  pages={379-404}
}
  • J. Chacón
  • Published 15 September 2016
  • Computer Science
  • Advances in Data Analysis and Classification
The two most extended density-based approaches to clustering are surely mixture model clustering and modal clustering. In the mixture model approach, the density is represented as a mixture and clusters are associated to the different mixture components. In modal clustering, clusters are understood as regions of high density separated from each other by zones of lower density, so that they are closely related to certain regions around the density modes. If the true density is indeed in the… 
Mode merging for the finite mixture of t‐distributions
TLDR
A mode merging method via the mean shift for the finite mixture of t‐distributions and its parsimonious variants is introduced, which can be framed as an expectation–maximization algorithm and enjoys similar theoretical properties as the meanshift for the Gaussian finite mixture.
A fast and efficient Modal EM algorithm for Gaussian mixtures
  • L. Scrucca
  • Computer Science
    Stat. Anal. Data Min.
  • 2021
TLDR
A fast and efficient MEM algorithm to be used when the density function is estimated through a finite mixture of Gaussian distributions with parsimonious component‐covariance structures is proposed.
Modal clustering asymptotics with applications to bandwidth selection
TLDR
A natural and easy to interpret metric to measure the distance between density-based partitions is discussed, its asymptotic approximation explored, and employed to study the problem of bandwidth selection for nonparametric modal clustering.
Unsupervised Clustering of Neighborhood Associations and Image Segmentation Applications
TLDR
A new neighborhood density correlation clustering (NDCC) algorithm for quickly discovering arbitrary shaped clusters that can cluster the same ground objects in remote sensing images into one class and distinguish different ground objects.
Better than the best? Answers via model ensemble in density-based clustering
TLDR
This work proposes an ensemble clustering approach that circumvents the single best model paradigm, while improving stability and robustness of the partitions, and shows how blending together parametric and nonparametric approaches may be beneficial from a clustering perspective.
Nonparametric density estimation for high‐dimensional data—Algorithms and applications
TLDR
This paper reviews a collection of selected nonparametric density estimation algorithms for high‐dimensional data, some of them are recently published and provide interesting mathematical insights.
How bettering the best? Answers via blending models and cluster formulations in density-based clustering
TLDR
This work proposes an ensemble clustering approach that circumvents the single best model paradigm, while improving stability and robustness of the partitions, and shows how blending together parametric and nonparametric approaches may be beneficial from a clustering perspective.
Selective Clustering Annotated using Modes of Projections
TLDR
Clustering annotated using modes of projections concludes by annotating each selected cluster with labels that describe how cluster-level statistics compare to certain dataset-level quantities.
An Asymptotic Equivalence between the Mean-Shift Algorithm and the Cluster Tree
TLDR
This paper proposes two ways of obtaining a partition from the cluster tree and shows that both of them reduce to the partition given by the gradient flow under standard assumptions on the sampling density.
Univariate log-concave density estimation with symmetry or modal constraints
We study nonparametric maximum likelihood estimation of a log-concave density function $f_0$ which is known to satisfy further constraints, where either (a) the mode $m$ of $f_0$ is known, or (b)
...
...

References

SHOWING 1-10 OF 55 REFERENCES
Combining Mixture Components for Clustering
  • J. Baudry, A. Raftery, G. Celeux, Kenneth Lo, R. Gottardo
  • Computer Science
    Journal of computational and graphical statistics : a joint publication of American Statistical Association, Institute of Mathematical Statistics, Interface Foundation of North America
  • 2010
TLDR
This paper proposes first selecting the total number of Gaussian mixture components, K, using BIC and then combining them hierarchically according to an entropy criterion, which yields a unique soft clustering for each number of clusters less than or equal to K.
Identifying connected components in Gaussian finite mixture models for clustering
  • L. Scrucca
  • Computer Science
    Comput. Stat. Data Anal.
  • 2016
Methods for merging Gaussian mixture components
  • C. Hennig
  • Computer Science
    Adv. Data Anal. Classif.
  • 2010
TLDR
Several different hierarchical merging methods are proposed for different cluster concepts, based on the ridgeline analysis of modality of Gaussian mixtures, the dip test, the Bhattacharyya dissimilarity, a direct estimator of misclassification and the strength of predicting pairwise cluster memberships.
A Population Background for Nonparametric Density-Based Clustering
TLDR
It is shown that only mild conditions on a sequence of density estimators are needed to ensure that the sequence of modal clusterings that they induce is consistent and two new loss functions are presented, applicable in fact to any clustering methodology, to evaluate the performance of a data-based clustering algorithm with respect to the ideal population goal.
Model-Based Clustering, Discriminant Analysis, and Density Estimation
TLDR
This work reviews a general methodology for model-based clustering that provides a principled statistical approach to important practical questions that arise in cluster analysis, such as how many clusters are there, which clustering method should be used, and how should outliers be handled.
mclust 5: Clustering, Classification and Density Estimation Using Gaussian Finite Mixture Models
TLDR
This updated version of mclust adds new covariance structures, dimension reduction capabilities for visualisation, model selection criteria, initialisation strategies for the EM algorithm, and bootstrap-based inference, making it a full-featured R package for data analysis via finite mixture modelling.
On the upper bound of the number of modes of a multivariate normal mixture
Mixture models : inference and applications to clustering
TLDR
The Mixture Likelihood Approach to Clustering and the Case Study Homogeneity of Mixing Proportions Assessing the Performance of the Mixture likelihood approach toClustering.
Flexible mixture modelling using the multivariate skew-t-normal distribution
This paper presents a robust probabilistic mixture model based on the multivariate skew-t-normal distribution, a skew extension of the multivariate Student’s t distribution with more powerful
...
...