A fault tolerant peer-to-peer distributed EM algorithm
Behrooz Safarinejadian, Mohammad Bagher Menhaj, Mehdi KARRARI · 2009
In this paper, a distributed Expectation Maximization (EM) algorithm is proposed for estimating parameters of a Gaussian mixture model in a peer-to-peer network. This algorithm is used for density estimation and clustering of data distributed over nodes of a network. Scalability and fault tolerance are two important advantages of this method. In the E-step of this algorithm, each node calculates local sufficient statistics using its local observations. A peer-to-peer algorithm is then used to diffuse local sufficient statistics to neighboring nodes and estimate global sufficient statistics in each node. In the M-step, each node updates parameters of the Gaussian mixture model using the estimated global sufficient statistics. The proposed method is then used for environmental monitoring and also distributed target classification. Simulation results approve promising performance of this algorithm.