next up previous
Next: Johnson's Algorithm Up: Hierarchical Clustering Previous: For Single-Link Clustering

Matrix Updating Algorithms

The algorithms is an agglomerative scheme that erases rows and columns in the proximity matrix as old clusters are merged into new ones.

The n * n proximity matrix is D = [d(i,j)]. The clusterings are assigned sequence numbers 0,1,......, (n-1) and L(k) is the level of the kth clustering. A cluster with sequence number m is denoted (m) and the proximity between clusters (r) and (s) is denoted d [(r),(s)].





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