Analysis of the k-means algorithm in the case of data points occurring on the border of two or more clusters

  • Authors:
  • Rudolf Scitovski;Kristian Sabo

  • Affiliations:
  • -;-

  • Venue:
  • Knowledge-Based Systems
  • Year:
  • 2014

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, the well-known k-means algorithm for searching for a locally optimal partition of the set A@?R^n is analyzed in the case if some data points occur on the border of two or more clusters. For this special case, a useful strategy by implementation of the k-means algorithm is proposed.