Rethinking Divisive Hierarchical Clustering from a Distributional Perspective
Kaifeng Zhang, Kai Ming Ting, Tianrun Liang, Qiuran Zhao
TL;DR
Rethinking Divisive Hierarchical Clustering shows that objective-based DHC using set-oriented bisecting fails to preserve cluster integrity and ground-truth structure. It introduces H-$\mathcal{K}C$, a distributional-kernel driven method that treats clusters as distributions and optimizes a total similarity objective $TSC$, with a proven global lower-bound guarantee and linear-time complexity. The approach yields dendrograms that avoid unwarranted splitting, group similar clusters, and align with ground-truth regions, demonstrated on artificial data and Spatial Transcriptomics including HER2 and Slide-seq V2, where it outperforms baselines. This distribution-oriented framework offers scalable, shape-agnostic clustering that can reveal biologically meaningful hierarchical structure in complex datasets.
Abstract
We uncover that current objective-based Divisive Hierarchical Clustering (DHC) methods produce a dendrogram that does not have three desired properties i.e., no unwarranted splitting, group similar clusters into a same subset, ground-truth correspondence. This shortcoming has their root cause in using a set-oriented bisecting assessment criterion. We show that this shortcoming can be addressed by using a distributional kernel, instead of the set-oriented criterion; and the resultant clusters achieve a new distribution-oriented objective to maximize the total similarity of all clusters (TSC). Our theoretical analysis shows that the resultant dendrogram guarantees a lower bound of TSC. The empirical evaluation shows the effectiveness of our proposed method on artificial and Spatial Transcriptomics (bioinformatics) datasets. Our proposed method successfully creates a dendrogram that is consistent with the biological regions in a Spatial Transcriptomics dataset, whereas other contenders fail.
