The most widely used partitioning method in cluster analysis is the k-means clustering which minimizes within-cluster sum of squares. However, the k-means clustering is sensitive to outliers or cluster structures. We introduce the k-spatial medians clustering which is less sensitive to outliers as an alternative to the k-means clustering and compare two clustering methods for some arti cial dat...

TAMPERE UNIVERSITY OF TECHNOLOGY Master’s Degree Program in Information Technology Ranganathan, Sindhuja: Improvements to k-means clustering Master’s thesis, 42 November 2013 Major Subject: Software Systems Examiner(s): Professor Tapio Elomaa

Much work has sought to discern the different types of cloud regimes, typically via Euclidean k-means clustering of histograms. However, these methods ignore the underlying similarity structure of cloud types. Wasserstein k-means clustering is a promising candidate for utilizing this structure during clustering, but existing algorithms do not scale well and lack the quality guarantees of the Eu...

Due to the progressive growth of the amount of data available in a wide variety of scientific fields, it has become more difficult to manipulate and analyze such information. In spite of its dependency on the initial settings and the large number of distance computations that it can require to converge, the K-means algorithm remains as one of the most popular clustering methods for massive data...

The k-means++ algorithm is the state of the art algorithm to solve k-Means clustering problems as the computed clusterings are O(log k) competitive in expectation. However, its seeding step requires k inherently sequential passes through the full data set making it hard to scale to massive data sets. The standard remedy is to use the k-means‖ algorithm which reduces the number of sequential rou...

This paper presents the fourth participation of the SINAI group, University of Jaén, in the Photo Retrieval task at Image CLEF 2009. Our system uses only the text of the queries, and a clustering system (based on kmeans) that combines different approaches based on a different use of the cluster data of the queries. The official results shown that the combination between the title of each query ...

K-means is a widely used iterative clustering algorithm. There has been considerable work on improving k-means in terms of mean squared error (MSE) and speed, both. However, most of the k-means variants tend to compute distance of each data point to each cluster centroid for every iteration. We propose two heuristics to overcome this bottleneck and speed up k-means. Our first heuristic predicts...