Twister Tries: Approximate Hierarchical Agglomerative Clustering for Average Distance in Linear Time
Summary: Twister Tries with locality-sensitive hashing enable approximate average-distance hierarchical agglomerative clustering for data. Achieves O(n) time and O(n) space, unlike O(n^2) baselines, with analytic and empirical validation on diverse datasets. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Michael Cochez
- 2. Hao Mou
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,383 | ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain | 2022 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next