Partitioning Well-Clustered Graphs with k-Means and Heat Kernel
A simple linear time (1 + /spl epsiv/)-approximation algorithm for k-means clustering in any dimensions