EM algorithm of spherical models for binned data

Abstract : In cluster analysis, dealing with large quantity of data is computational expensive. And binning data can be efficient in solving this problem. In the former study, basing cluster analysis on Gaussian mixture models becomes a classical and powerful approach. EM and CEM algorithm are commonly used in mixture approach and classification approach respectively. According to the parametrization of the variance matrices (allowing some of the features of clusters be the same or different: orientation, shape and volume), 14 Gaussian parsimonious models can be generated. Choosing the right parsimonious model is important in obtaining a good result. According to the existing study, Binned-EM algorithm was performed for the most general and diagonal model. In this paper, we apply binned-EM algorithm on spherical models. Two spherical models are studied and their performances on simulated data are compared. The influence of the size of bins in binned-EM algorithm is analyzed. Practical application is shown by applying on Iris data.
Complete list of metadatas

https://hal-supelec.archives-ouvertes.fr/hal-00658924
Contributor : Karine El Rassi <>
Submitted on : Wednesday, January 11, 2012 - 3:49:13 PM
Last modification on : Thursday, March 29, 2018 - 11:06:05 AM

Identifiers

Collections

Citation

Hani Hamdan, Jingwen Wu. EM algorithm of spherical models for binned data. 2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT 2011) , Dec 2011, Bilbao, Spain. ⟨10.1109/ISSPIT.2011.6151542⟩. ⟨hal-00658924⟩

Share

Metrics

Record views

193