next up previous
Next: Clustering by mixture decomposition Up: Partitional Clustering Previous: Partitional Clustering

Square error clustering methods

The most commonly used clustering strategy is based on the square-root error criterion.
Objective: To obtain a partition which, for a fixed number of clusters, minimizes the square-error where square-error is the sum of the Euclidean distances between each pattern and its cluster center.

Algorithm

  1. Select an initial partition with k clusters. Repeat steps 2 through 5 until the cluster membership stabilizes.
  2. Generate a new partition by assigning each pattern to its closest cluster center.
  3. Compute new cluster centers as the centroids of the clusters.
  4. Repeat steps 2 and 3 until an optimum value of the criterion is found.
  5. Adjust the number of clusters by merging and splitting existing clusters or by removing small or outlier clusters.
The algorithm converges when the criterion function cannot be improved.

Initial partition


Updating a partition
K-means:

Adjusting the number of clusters


Performance of square-error clustering methods


next up previous
Next: Clustering by mixture decomposition Up: Partitional Clustering Previous: Partitional Clustering

Miranda Maria Irene
Thu Apr 1 15:43:18 IST 1999