# Reliable Agglomerative Clustering

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

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 20 Dec 2018.

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

- [Shift of Pairwise Similarities for Data Clustering](https://mlsanity.com/paper/2110.13103/) (2021)
- [A Unified Framework for Online Trip Destination Prediction](https://mlsanity.com/paper/2101.04520/) (2021)

## Abstract (arXiv)

Standard agglomerative clustering suggests establishing a new reliable linkage at every step. However, in order to provide adaptive, density-consistent and flexible solutions, we study extracting all the reliable linkages at each step, instead of the smallest one. Such a strategy can be applied with all common criteria for agglomerative hierarchical clustering. We also study that this strategy with the single linkage criterion yields a minimum spanning tree algorithm. We perform experiments on several real-world datasets to demonstrate the performance of this strategy compared to the standard alternative.