OneBatchPAM runs FasterPAM-style local search on an objective estimated from one random log-sized batch, cutting dissimilarity complexity to O(n log n) while matching FasterPAM quality on tested datasets.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
OneBatchPAM: A Fast and Frugal K-Medoids Algorithm
OneBatchPAM runs FasterPAM-style local search on an objective estimated from one random log-sized batch, cutting dissimilarity complexity to O(n log n) while matching FasterPAM quality on tested datasets.