SUMMARY: Hierarchical cluster analysis
-
Hierarchical cluster analysis of n objects is defined by a stepwise algorithm which merges two objects at each step, the two which have the least dissimilarity.
-
Dissimilarities between clusters of objects can be defined in several ways; for example, the maximum dissimilarity (complete linkage), minimum dissimilarity (single linkage) or average dissimilarity (average linkage).
-
Either rows or columns of a matrix can be clustered – in each case we choose the