In K-means the computation process is relatively short and efficient for delivering large amounts of data. K-means clustering produces high accuracy and requires a fairly short time in its clustering process.

Papers:

K. Kaur, D. S. Dhaliwal, and R. K. Vohra, “Statistically Refining the Initial Points for K-means Clustering Algorithm,” vol. 2, no. 11, pp. 2972–2977, 2013.

B. R. Jipkate and V. V Gohokar, “‘ A Comparative Analysis of Fuzzy C-Means Clustering and K Means Clustering Algorithms ,’” Int. J. Comput. Eng. Res., vol. 2, no. 3, pp. 737–739, 2012.