Solving non-uniqueness in agglomerative hierarchical clustering using multidendrograms

Abstract

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 and Williams' formula which enables the implementation of the algorithm in a recursive way.

Free Software for Agglomerative Hierarchical Clustering using Multidendrograms available at http://deim.urv.cat/~sgomez/multidendrograms.php

Cited by in corpus (9)

• Versatile linkage: a family of space-conserving strategies for agglomerative hierarchical clustering
• Unsupervised clustering analysis: a multiscale complex networks approach
• Stratified communities in complex business networks
• Multiview Hierarchical Agglomerative Clustering for Identification of Development Gap and Regional Potential Sector
• Structural patterns in complex systems using multidendrograms
• Towards Design of System Hierarchy (research survey)
• Graph Analysis Using a GPU-based Parallel Algorithm: Quantum Clustering
• Mining Temporal Patterns from iTRAQ Mass Spectrometry(LC-MS/MS) Data
• MultiDendrograms: Variable-Group Agglomerative Hierarchical Clusterings