k-means: A revisit

• Main Authors: ZHAO, Wan-Lei, DENG, Cheng-Hao, NGO, Chong-wah
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2018
• Subjects: Clustering; k-means; Incremental optimization; Computer Engineering
• Online Access: https://ink.library.smu.edu.sg/sis_research/6304; https://ink.library.smu.edu.sg/context/sis_research/article/7307/viewcontent/kmean.pdf
• Institution: Singapore Management University

Due to its simplicity and versatility, k-means remains popular since it was proposed three decades ago. The performance of k-means has been enhanced from different perspectives over the years. Unfortunately, a good trade-off between quality and efficiency is hardly reached. In this paper, a novel k-means variant is presented. Different from most of k-means variants, the clustering procedure is driven by an explicit objective function, which is feasible for the whole l(2)-space. The classic egg-chicken loop in k-means has been simplified to a pure stochastic optimization procedure. The procedure of k-means becomes simpler and converges to a considerably better local optima. The effectiveness of this new variant has been studied extensively in different contexts, such as document clustering, nearest neighbor search and image clustering. Superior performance is observed across different scenarios. (c) 2018 Elsevier B.V. All rights reserved.