pith. sign in

arxiv: 1305.0626 · v1 · pith:67I2IZT5new · submitted 2013-05-03 · 💻 cs.LG · cs.AI· stat.ML

An Improved EM algorithm

classification 💻 cs.LG cs.AIstat.ML
keywords algorithmexpectationmaximizationinitializeinitializedresultexperimentexperiments
0
0 comments X
read the original abstract

In this paper, we firstly give a brief introduction of expectation maximization (EM) algorithm, and then discuss the initial value sensitivity of expectation maximization algorithm. Subsequently, we give a short proof of EM's convergence. Then, we implement experiments with the expectation maximization algorithm (We implement all the experiments on Gaussion mixture model (GMM)). Our experiment with expectation maximization is performed in the following three cases: initialize randomly; initialize with result of K-means; initialize with result of K-medoids. The experiment result shows that expectation maximization algorithm depend on its initial state or parameters. And we found that EM initialized with K-medoids performed better than both the one initialized with K-means and the one initialized randomly.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.