Academic Journals Database
Disseminating quality controlled scientific knowledge

A Review of K-mean Algorithm

ADD TO MY LIST
 
Author(s): Jyoti Yadav#1 , Monika Sharma

Journal: International Journal of Engineering Trends and Technology
ISSN 2231-5381

Volume: 4;
Issue: 7;
Start page: 2972;
Date: 2013;
VIEW PDF   PDF DOWNLOAD PDF   Download PDF Original page

Keywords: Clustering | K-mean | Computational Complexity

ABSTRACT
Cluster analysis is a descriptive task that seek to identify homogenous group of object and it is also one of the main analytical method in data mining. K-mean is the most popular partitional clustering method. In this paper we discuss standard k-mean algorithm and analyze the shortcoming of kmean algorithm. In this paper three dissimilar modified k-mean algorithm are discussed which remove the limitation of k-mean algorithm and improve the speed and efficiency of k-mean algorithm. First algorithm remove the requirement of specifying the value of k in advance practically which is very difficult. This algorithm result in optimal number of cluster Second algorithm reduce computational complexity and remove dead unit problem. It select the most populated area as cluster center. Third algorithm use simple data structure that can be used to store information in each iteration and that information can be used in next iteration. It increase the speed of clustering and reduce time complexity
Save time & money - Smart Internet Solutions     

Tango Jona
Tangokurs Rapperswil-Jona