asa136, an Octave code which divides N points in M dimensions into K clusters so that the within-clusters sum of squares is minimized, by Hartigan and Wong.
This is a version of Applied Statistics Algorithm 136.
In the K-Means problem, a set of N points X(I) in M-dimensions is given. The goal is to arrange these points into K clusters, with each cluster having a representative point Z(J), usually chosen as the centroid of the points in the cluster. The energy of each cluster is
E(J) = Sum ( all points X(I) in cluster J ) || X(I) - Z(J) ||^2
For a given set of clusters, the total energy is then simply the sum of the cluster energies E(J). The goal is to choose the clusters in such a way that the total energy is minimized. Usually, a point X(I) goes into the cluster with the closest representative point Z(J). So to define the clusters, it's enough simply to specify the locations of the cluster representatives.
This is actually a fairly hard problem. Most algorithms do reasonably well, but cannot guarantee that the best solution has been found. It is very common for algorithms to get stuck at a solution which is merely a "local minimum". For such a local minimum, every slight rearrangement of the solution makes the energy go up; however a major rearrangement would result in a big drop in energy.
A simple algorithm for the problem is known as "H-Means". It alternates between two procedures:
A more sophisticated algorithm, known as "K-Means", takes advantage of the fact that it is possible to quickly determine the decrease in energy caused by moving a point from its current cluster to another. It repeats the following procedure:
The computer code and data files described and made available on this web page are distributed under the MIT license
asa136 is available in a C version and a C++ version and a Fortran90 version and a MATLAB version and an Octave version.
asa058, an Octave code which carries out the K-means algorithm for clustering data.
asa113, an Octave code which implements the Banfield and Bassill clustering algorithm using transfers and swaps.
cities, an Octave code which handles various problems associated with a set of "cities" on a map.
cities, a dataset directory which contains a number of city distance datasets.
kmeans, an Octave code which contains several implementations of the H-Means and K-Means clustering algorithms.
sammon_data, an Octave code which generates six sets of M-dimensional data for cluster analysis.
spaeth, a dataset directory which contains test data for clustering.
spaeth2, a dataset directory which contains test data for clustering.
Original FORTRAN77 version by John Hartigan, Manchek Wong; This version by John Burkardt.