A dynamic structural clustering algorithm achieves O(log n) amortized expected update time for Jaccard, Cosine, and Dice similarities under arbitrary edge updates.
A spectral clustering approach to finding communities in graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters
A dynamic structural clustering algorithm achieves O(log n) amortized expected update time for Jaccard, Cosine, and Dice similarities under arbitrary edge updates.