Fast-Coresets: A Nearly-Linear Time Algorithm for Efficient Clustering

Fast-Coresets offer a nearly-linear time solution for clustering compression, balancing efficiency and accuracy. While sensitivity sampling remains the gold standard, heuristic methods can achieve competitive results for well-behaved datasets. Experimental results show that Fast-Coresets provide reliable compression with logarithmic runtime scaling, outperforming traditional approaches in speed.