DynHAC is the first fully dynamic algorithm for average-linkage hierarchical clustering that maintains a (1+epsilon)-approximate dendrogram under point insertions and deletions.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 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.