Submit Manuscript

Journal of Applied Sciences

Year: 2009 | Volume: 9 | Issue: 5 | Page No.: 854-864
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Article Trend

Total views 415

Search

Authors

B. Safarinejadian

M.B. Menhaj

M. Karrari

Keywords

Research Article

Distributed Data Clustering Using Expectation Maximization Algorithm

B. Safarinejadian, M.B. Menhaj and M. Karrari
In this study, a distributed expectation maximization (DEM) algorithm is first introduced in a general form for estimating parameters of a finite mixture of components. This algorithm is used for density estimation and clustering of the data distributed over the nodes of a network. Then, a distributed incremental EM algorithm (DIEM) with a higher convergence rate is proposed. After a full derivation of distributed EM algorithms, convergence of both DEM and DIEM algorithms is studied based on the negative free energy concept. It is shown that these algorithms increase the negative free energy incrementally at each node until reaching the convergence. Finally, the proposed algorithms are applied to cluster analysis of gene-expression data. Simulation results approve that DIEM remarkably outperforms DEM.
PDF Fulltext XML References Citation

Leave a Comment

Your email address will not be published. Required fields are marked *