A Nearly Tight Analysis of Greedy k-means++

A Nearly Tight Analysis of Greedy k-means++

ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022

16 July 2022

Christoph Grunau

Ahmet Alper Ozudougru

ArXiv (abs)PDF HTML

Papers citing "A Nearly Tight Analysis of Greedy k-means++"

5 / 5 papers shown

Title
CORE-ReID V2: Advancing the Domain Adaptation for Object Re-Identification with Optimized Training and Ensemble Fusion Trinh Quoc Nguyen Oky Dicky Ardiansyah Prima Syahid Al Irfan Hindriyanto Dwi Purnomo Radius Tanone 101 2 0 06 Aug 2025
Classification of power quality events in the transmission grid: comparative evaluation of different machine learning models Umut Güvengir Dilek Küçük Serkan Buhan Cuma Ali Mantaş Murathan Yeniceli 123 1 0 17 Mar 2025
Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search Jack Spalding-Jamieson Eliot Wong Robson D. Zheng 191 2 0 10 Feb 2025
An Analysis of $D^α$ seeding for $k$ -means Étienne Bamas Sai Ganesh Nagarajan Ola Svensson 51 0 0 20 Oct 2023
$k$ -Median Clustering via Metric Embedding: Towards Better Initialization with Differential PrivacyNeural Information Processing Systems (NeurIPS), 2022 Chenglin Fan Ping Li Xiaoyun Li 211 7 0 26 Jun 2022