Article ID Journal Published Year Pages File Type
402705 Knowledge-Based Systems 2014 7 Pages PDF
Abstract

In this paper, the well-known k  -means algorithm for searching for a locally optimal partition of the set A⊂RnA⊂Rn 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.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Artificial Intelligence
Preview
Analysis of the k-means algorithm in the case of data points occurring on the border of two or more clusters
Authors
, ,