Solving Non-Uniqueness in Agglomerative Hierarchical Clustering Using Multidendrograms
- First Online:
- Cite this article as:
- Fernández, A. & Gómez, S. J Classif (2008) 25: 43. doi:10.1007/s00357-008-9004-x
- 261 Downloads
In agglomerative hierarchical clustering, pair-group methods suffer from a problem of non-uniqueness when two or more distances between different clusters coincide during the amalgamation process. The traditional approach for solving this drawback has been to take any arbitrary criterion in order to break ties between distances, which results in different hierarchical classifications depending on the criterion followed. In this article we propose a variable-group algorithm that consists in grouping more than two clusters at the same time when ties occur. We give a tree representation for the results of the algorithm, which we call a multidendrogram, as well as a generalization of the Lance andWilliams’ formula which enables the implementation of the algorithm in a recursive way.