Boost K-Means

10/08/2016
by   Wan-Lei Zhao, et al.
0

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 l2-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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/19/2020

k-sums: another side of k-means

In this paper, the decades-old clustering method k-means is revisited. T...
research
01/30/2017

Scalable Nearest Neighbor Search based on kNN Graph

Nearest neighbor search is known as a challenging issue that has been st...
research
10/27/2020

Improved Guarantees for k-means++ and k-means++ Parallel

In this paper, we study k-means++ and k-means++ parallel, the two most p...
research
05/04/2017

Fast k-means based on KNN Graph

In the era of big data, k-means clustering has been widely adopted as a ...
research
10/03/2015

P-trac Procedure: The Dispersion and Neutralization of Contrasts in Lexicon

Cognitive acoustic cues have an important role in shaping the phonologic...
research
07/17/2019

t-k-means: A k-means Variant with Robustness and Stability

Lloyd's k-means algorithm is one of the most classical clustering method...

Please sign up or login with your details

Forgot password? Click here to reset