Goto

Collaborating Authors

 Clustering






Linear Time Algorithms for k-means with Multi-Swap Local Search Junyu Huang

Neural Information Processing Systems

The local search methods have been widely used to solve the clustering problems. In practice, local search algorithms for clustering problems mainly adapt the single-swap strategy, which enables them to handle large-scale datasets and achieve linear running time in the data size.