From Data Mining and Analysis

Main: ExpectationMaximizationClustering

Write a script that implements the Expectation-Maximization (EM) algorithm for clustering (see Algorithm 13.3 in Chapter 13). Run the code on the iris.txt dataset. Use the first four attributes for clustering, and use the labels only for the purity-based clustering evaluation (see below). In your implementation, you should estimate the full covariance matrix for each cluster.

For EM initialization, use the first \(n/k\) points for cluster 1, the next \(n/k\) for cluster 2, and so on. For convergence testing, you can compare the sum of the euclidean distance between the old means and the new means over the \(k\) clusters. If this distance is less than \(\epsilon=0.001\) you can stop the method.

Your program output should consist of the following information:

  1. The final mean for each cluster
  2. The final covariance matrix for each cluster
  3. Number of iterations the EM algorithm took to converge.
  4. Final cluster assignment of all the points, where each point will be assigned to the cluster that yields the highest probability \(P(C_i|\mathbf{x}_j)\)
  5. Final size of each cluster

Finally, you must compute the 'purity score' for your clustering, computed as follows: Assume that \(C_i\) denotes the set of points assigned to cluster \(i\) by the EM algorithm, and let \(T_i\) denote the true assignments of the points based on the last attribute. Purity score is defined as: $$Purity= \frac{1}{n} \sum_{i=1}^k max_{j=1}^k \{C_i \cap T_j\} $$

Retrieved from http://www.cs.rpi.edu/~zaki/dataminingbook/pmwiki.php/Main/ExpectationMaximizationClustering
Page last modified on September 06, 2014, at 10:42 AM