MLSTJun 21, 2015

Beyond Hartigan Consistency: Merge Distortion Metric for Hierarchical Clustering

arXiv:1506.06422v249 citations
Originality Incremental advance
AI Analysis

This work provides a more robust theoretical framework for evaluating hierarchical clustering algorithms, addressing statistical inconsistencies that affect researchers and practitioners in data analysis.

The paper identifies limitations in Hartigan consistency for hierarchical clustering, such as over-segmentation and improper nesting, and introduces a merge distortion metric that addresses these issues by ensuring separation and minimality, with proven convergence for two clustering algorithms.

Hierarchical clustering is a popular method for analyzing data which associates a tree to a dataset. Hartigan consistency has been used extensively as a framework to analyze such clustering algorithms from a statistical point of view. Still, as we show in the paper, a tree which is Hartigan consistent with a given density can look very different than the correct limit tree. Specifically, Hartigan consistency permits two types of undesirable configurations which we term over-segmentation and improper nesting. Moreover, Hartigan consistency is a limit property and does not directly quantify difference between trees. In this paper we identify two limit properties, separation and minimality, which address both over-segmentation and improper nesting and together imply (but are not implied by) Hartigan consistency. We proceed to introduce a merge distortion metric between hierarchical clusterings and show that convergence in our distance implies both separation and minimality. We also prove that uniform separation and minimality imply convergence in the merge distortion metric. Furthermore, we show that our merge distortion metric is stable under perturbations of the density. Finally, we demonstrate applicability of these concepts by proving convergence results for two clustering algorithms. First, we show convergence (and hence separation and minimality) of the recent robust single linkage algorithm of Chaudhuri and Dasgupta (2010). Second, we provide convergence results on manifolds for topological split tree clustering.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes