By Topic

GK-means: an Efficient K-means Clustering Algorithm Based on Grid

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Xiaoyun Chen ; Sch. of Inf. Sci. & Eng., Lanzhou Univ., Lanzhou, China ; Youli Su ; Yi Chen ; Guohua Liu

As an important tool, clustering analysis is used in many applications such as pattern recognition, data mining, machine learning and statistics etc. K-means clustering, based on minimizing a formal objective function, is perhaps the most widely used and studied. But k the number of clusters needs users specify and the effective initial centers are difficult to select. Meanwhile, it is sensitive to noise data points. In this paper, we focus on choice the better initial centers to improve the quality of k-means and to reduce the computational complexity of k-means method. The proposed algorithm called GK-means, which combines grid structure and spatial index with k-means algorithm. Theoretical analysis and experimental results show the algorithm has high quality and efficiency.

Published in:

Computer Network and Multimedia Technology, 2009. CNMT 2009. International Symposium on

Date of Conference:

18-20 Jan. 2009