Gaussian parsimonious clustering models, Pattern Recognition, vol.28, issue.5, pp.781-793, 1995. ,
DOI : 10.1016/0031-3203(94)00125-6
URL : https://hal.archives-ouvertes.fr/inria-00074643
MCLUST: Software for Model-Based Cluster Analysis, Journal of Classification, vol.16, issue.2, pp.297-306, 1999. ,
DOI : 10.1007/s003579900058
Modeling the manifolds of images of handwritten digits, IEEE transactions on Neural Networks, vol.8, issue.1, pp.65-74, 1997. ,
Data clustering: 50 years beyond k-means. Pattern recognition letters, pp.31651-666, 2010. ,
Data clustering: a review, ACM computing surveys (CSUR), vol.31, issue.3, pp.264-323, 1999. ,
A dynamic split-and-merge approach for evolving cluster models, Evolving Systems, vol.55, issue.3, pp.135-151, 2012. ,
DOI : 10.1023/B:MACH.0000027785.44527.d6
Genetic algorithm-based clustering technique, Pattern Recognition, vol.33, issue.9, pp.1455-1465, 2000. ,
DOI : 10.1016/S0031-3203(99)00137-5
The EM algorithm and extensions, 2007. ,
Cross entropy clustering approach to iris segmentation for biometrics purpose, Schedae Informaticae, vol.24, pp.31-40, 2015. ,
Robust clustering by deterministic agglomeration EM of mixtures of multivariate t-distributions, Pattern Recognition, vol.35, issue.5, pp.1127-1142, 2002. ,
DOI : 10.1016/S0031-3203(01)00080-2
Detection of Elliptical Shapes via Cross-Entropy Clustering, Pattern Recognition and Image Analysis, pp.656-663, 2013. ,
DOI : 10.1007/978-3-642-38628-2_78
Cross-entropy clustering, Pattern Recognition, vol.47, issue.9, pp.3046-3059, 2014. ,
DOI : 10.1016/j.patcog.2014.03.006
URL : http://arxiv.org/pdf/1210.5594
SMEM Algorithm for Mixture Models, Neural Computation, vol.21, issue.9, pp.2109-2128, 2000. ,
DOI : 10.1207/s15327906mbr0503_6
Competitive EM algorithm for finite mixture models, Pattern Recognition, vol.37, issue.1, pp.131-144, 2004. ,
DOI : 10.1016/S0031-3203(03)00140-7
EM algorithms for Gaussian mixtures with split-and-merge operation, Pattern Recognition, vol.36, issue.9, pp.1973-1983, 2003. ,
DOI : 10.1016/S0031-3203(03)00059-1