# A comparative study of divisive hierarchical clustering algorithms

arXiv: https://arxiv.org/abs/1506.08977 · HTML: https://mlsanity.com/paper/1506.08977/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 30 Jun 2015.

## Built on by (most cited first, 3 of 3)

- [Clustered Embedding Learning for Recommender Systems](https://mlsanity.com/paper/2302.01478/) (2023)
- [Dynamic User Interest Augmentation via Stream Clustering and Memory Networks in Large-Scale Recommender Systems](https://mlsanity.com/paper/2405.13238/) (2024)
- [Beyond Conjugacy for Chain Event Graph Model Selection](https://mlsanity.com/paper/2211.03427/) (2022)

## Abstract (arXiv)

A general scheme for divisive hierarchical clustering algorithms is proposed. It is made of three main steps : first a splitting procedure for the subdivision of clusters into two subclusters, second a local evaluation of the bipartitions resulting from the tentative splits and, third, a formula for determining the nodes levels of the resulting dendrogram. A number of such algorithms is given. These algorithms are compared using the Goodman-Kruskal correlation coefficient. As a global criterion it is an internal goodness-of-fit measure based on the set order induced by the hierarchy compared to the order associated to the given dissimilarities. Applied to a hundred of random data tables, these comparisons are in favor of two methods based on unusual ratio-type formulas for the splitting procedures, namely the Silhouette criterion and Dunn's criterion. These two criteria take into account both the within cluster and the between cluster mean dissimilarity. In general the results of these two algorithms are better than the classical Agglomerative Average Link method.