First sampling algorithms with O(ε) additive error guarantees for local and global silhouette estimation in metric k-clustering, using O(nk ε^{-2} ln(nk/δ)) distances, plus constant-round distributed MapReduce/MPC versions.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Scalable and Distributed Silhouette Approximation
First sampling algorithms with O(ε) additive error guarantees for local and global silhouette estimation in metric k-clustering, using O(nk ε^{-2} ln(nk/δ)) distances, plus constant-round distributed MapReduce/MPC versions.