Work

Algoritam k-sredina

Year: 2016
Type: article
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.
Institution: University of Split
Language: English
Open Access status: green
OpenAlex ID: W2584721593
FWCI: 0.348
Cites: 5
Cited by: 3
Related to: 10