Bin-EM-CEM algorithms of spherical parsimonious Gaussian mixture models for binned data clustering

Abstract : EM algorithm is widely used in clustering domain because of its easy implementation and small storage space. CEM algorithm, which is considered as a classification version of EM algorithm, is another common used clustering algorithm. With the development of technology, we obtain more and more data. This results in slow computation of EM and CEM algorithms. Binning data seems to be efficient in gaining computation time by reducing the number of observations to the number of bins. Thus, EM and CEM algorithms applied to binned data were proposed: binned-EM and bin-EM-CEM algorithms. Moreover, fourteen parsimonious Gaussian mixture models, generated according to eigenvalue decomposition of the variance matrices of the mixture components, have less parameters than the most general model. By applying the EM and CEM algorithms of parsimonious models, estimation process is simplified and then accelerated. In this paper, to combine the advantages of binned data and parsimonious Gaussian mixture models, we develop bin-EM-CEM algorithms of spherical parsimonious Gaussian mixture models.
Complete list of metadatas

https://hal-supelec.archives-ouvertes.fr/hal-00862421
Contributor : Alexandra Siebert <>
Submitted on : Monday, September 16, 2013 - 4:01:28 PM
Last modification on : Thursday, March 29, 2018 - 11:06:05 AM

Identifiers

Collections

Citation

Hani Hamdan, Jingwen Wu. Bin-EM-CEM algorithms of spherical parsimonious Gaussian mixture models for binned data clustering. 2013 IEEE 17th International Conference on Intelligent Engineering Systems (INES 2013) , Jun 2013, San Jose, Costa Rica. pp.187-192, ⟨10.1109/INES.2013.6632808⟩. ⟨hal-00862421⟩

Share

Metrics

Record views

110