Evolving limitations in K-means algorithm in data mining and their removal

In the modern world large amount of information is stored in our database. These information are stored at different places in our data bases, therefore we have to develop some methods for extracting essential Information from these databases. Therefore we have to develop some methods for extracting essential Information from these databases; data mining is the process of extracting this information. There are various types of algorithms in data mining process. From these algorithm k-means algorithm is evolved. K-means is very popular because it is conceptually simple and is computationally fast and memory efficient but there are various types of limitations in k means algorithm that makes extraction some what difficult. In this paper we are discussing

[1]  Athman Bouguettaya,et al.  On-Line Clustering , 1996, IEEE Trans. Knowl. Data Eng..

[2]  John Vert,et al.  Windows NT clusters for availability and scalabilty , 1997, Proceedings IEEE COMPCON 97. Digest of Papers.

[3]  Edie M. Rasmussen,et al.  Parallel database processing: Text retrieval and cluster analysis using the DAP , 1990 .

[4]  Euripides G. M. Petrakis,et al.  Similarity Searching in Medical Image Databases , 1997, IEEE Trans. Knowl. Data Eng..