LGMay 10, 2017

An initialization method for the k-means using the concept of useful nearest centers

arXiv:1705.03613v11 citations
Originality Incremental advance
AI Analysis

This addresses the initialization problem in k-means clustering for data analysis applications, but it is incremental as it builds on existing initialization techniques.

The paper tackles the sensitivity of k-means clustering to initial centers by proposing an initialization method based on the concept of useful nearest centers for each data point, resulting in improved clustering performance as indicated by reduced sensitivity and better optimization of the squared sum of Euclidean distance from the mean.

The aim of the k-means is to minimize squared sum of Euclidean distance from the mean (SSEDM) of each cluster. The k-means can effectively optimize this function, but it is too sensitive for initial centers (seeds). This paper proposed a method for initialization of the k-means using the concept of useful nearest center for each data point.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes