2025
OneBatchPAM: A Fast and Frugal K-Medoids Algorithm
AAAI 2025technical
This paper proposes a novel k-medoids approximation algorithm to handle large-scale datasets with reasonable computational time and memory complexity. We develop a local-search algorithm that iteratively improves the medoid selection based on the estimation of the k-medoids objective. A single batch…