Joining (Tree Clustering) Introductory Overview - Amalgamation or Linkage Rules

At the first step, when each object represents its own cluster, the distances between those objects are defined by the chosen distance measure. However, once several objects have been linked together, how do we determine the distances between those new clusters? In other words, we need a linkage or amalgamation rule to determine when two clusters are sufficiently similar to be linked together. There are various possibilities: for example, we could link two clusters together when any two objects in the two clusters are closer together than the respective linkage distance. Put another way, we use the "nearest neighbors" across clusters to determine the distances between clusters; this method is called single linkage. This rule produces "stringy" types of clusters, that is, clusters "chained together" by only single objects that happen to be close together. Alternatively, we may use the neighbors across clusters that are furthest away from each other; this method is called complete linkage. There are numerous other linkage rules such as these that have been proposed, and the Cluster Analysis module offers a wide choice of them.

Single linkage (nearest neighbor).

Complete linkage (furthest neighbor).

Unweighted pair-group average.

Weighted pair-group average.

Unweighted pair-group centroid.

Weighted pair-group centroid (median).

Ward's method.

This discription has been taken from the standard STATISTICA packege, Help-option.