DynHAC is the first fully dynamic algorithm for average-linkage hierarchical clustering that maintains a (1+epsilon)-approximate dendrogram under point insertions and deletions.
Terahac: Hierarchical agglomerative clustering of trillion-edge graphs,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering
DynHAC is the first fully dynamic algorithm for average-linkage hierarchical clustering that maintains a (1+epsilon)-approximate dendrogram under point insertions and deletions.