Fast k-means software

This page is for research in accelerating the k-means clustering algorithm. This is for the following papers:

  1. Petr Ryšavý, Greg Hamerly. Geometric methods to accelerate k-means algorithms To appear at SDM 2016, 2016. [pdf, supplementary graphs]
  2. Greg Hamerly, Jonathan Drake. Accelerating Lloyd's algorithm for k-means clustering. Chapter in Partitional Clustering Algorithms (Springer), 2014. [pdf]
  3. Jonathan Drake, Greg Hamerly. Accelerated k-means with adaptive distance bounds. In OPT2012: the 5th NIPS Workshop on Optimization for Machine Learning, December, 2012. [pdf]
  4. Greg Hamerly, Making k-means even faster In proceedings of the 2010 SIAM international conference on data mining (SDM 2010), April 2010. [pdf]




Copyright © 2014 Greg Hamerly
Computer Science Department
Baylor University

valid html and css