Expectation Maximization Algorithm (EM)

Model based clustering make assumptions about clusters which randomly chosen at the beginning. At expectation maximization we can use probability density function to get a model of a cluster that we created before and move objects between clusters to create perfect (smallest) standard deviation from the cluster model. To do this we can find the occurrence probability of an object in cluster.
You can find an implementation of EM algorithm below;
Download File

And do not forget to download commons-lang3-3.0 library from apache site.


Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s