Skip to the main content

KoG, Vol. 20 No. 20, 2016.

Professional paper

k-means Algorithm

Ivančica Mirošević orcid id orcid.org/0000-0002-6356-1943 ; Faculty of Electrical Engineering, Mechanical Engineering and Naval Architecture, University of Split, Split, Croatia

Full text: croatian pdf 3.299 Kb

versions

page 91-98

downloads: 1.069

cite

Abstract

In this paper, k-means algorithm is presented. It is a heuristic algorithm for solving NP-hard optimisation problem of classifying a given data into clusters, with a number of clusters fixed apriori. The algorithm is simple and it's convergence is fast, what makes it widely used, despite its tendency of stoping in a local minimum and inability of recognizing clusters not separated by hyper-planes. The method of the first variation as a tool for escaping from a local minimum is also presented in the paper.

Keywords

k-means algorithm; clustering; fi rst variation method

Hrčak ID:

174106

URI

https://hrcak.srce.hr/174106

Publication date:

16.1.2017.

Article data in other languages: croatian

Visits: 1.927 *