Research on k-means Clustering Algorithm: An Improved k-means Clustering Algorithm

Authors:
Shi Na;Liu Xumin;Guan Yong
Affiliations:
-;-;-
Venue:
IITSI '10 Proceedings of the 2010 Third International Symposium on Intelligent Information Technology and Security Informatics
Year:
2010

Citing 0
Cited 7

Spatio-temporal image tracking based on optical flow and clustering: an endoneurosonographic application

MICAI'10 Proceedings of the 9th Mexican international conference on Advances in artificial intelligence: Part I
3D object modeling with graphics hardware acceleration and unsupervised neural networks

ISVC'11 Proceedings of the 7th international conference on Advances in visual computing - Volume Part I
Acquisition of three-dimensional information of brain structures using endoneurosonography

Expert Systems with Applications: An International Journal
Far efficient K-means clustering algorithm

Proceedings of the International Conference on Advances in Computing, Communications and Informatics
Speaker recognition utilizing distributed DCT-II based Mel frequency cepstral coefficients and fuzzy vector quantization

International Journal of Speech Technology
A Time Efficient Clustering Algorithm for Gray Scale Image Segmentation

International Journal of Computer Vision and Image Processing
Accelerate MapReduce on GPUs with multi-level reduction

Proceedings of the 5th Asia-Pacific Symposium on Internetware

Quantified Score

Hi-index	0.00

Visualization

Abstract

Clustering analysis method is one of the main analytical methods in data mining, the method of clustering algorithm will influence the clustering results directly. This paper discusses the standard k-means clustering algorithm and analyzes the shortcomings of standard k-means algorithm, such as the k-means clustering algorithm has to calculate the distance between each data object and all cluster centers in each iteration, which makes the efficiency of clustering is not high. This paper proposes an improved k-means algorithm in order to solve this question, requiring a simple data structure to store some information in every iteration, which is to be used in the next interation. The improved method avoids computing the distance of each data object to the cluster centers repeatly, saving the running time. Experimental results show that the improved method can effectively improve the speed of clustering and accuracy, reducing the computational complexity of the k-means.