Speeding-Up Hierarchical Agglomerative Clustering in Presence of Expensive Metrics

In several contexts and domains, hierarchical agglomerative clustering (HAC) offers best-quality results, but at the price of a high complexity which reduces the size of datasets which can be handled. In some contexts, in particular, computing distances between objects is the most expensive task. In this paper we propose a pruning heuristics aimed at improving performances in these cases, which is well integrated in all the phases of the HAC process and can be applied to two HAC variants: single-linkage and complete-linkage. After describing the method, we provide some theoretical evidence of its pruning power, followed by an empirical study of its effectiveness over different data domains, with a special focus on dimensionality issues.

• Type: Conference
• Year: 2005
• Where: PAKDD
• Authors: Mirco Nanni
• Keywords: Data Mining, HAC Process, HAC Variants, Hierarchical Agglomerative Clustering, PAKDD 2005