By Topic

An efficient K-Means clustering algorithm for reducing time complexity using uniform distribution data points

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

2 Author(s)
Napoleon, D. ; Dept. of Comput. Sci., Bharathiar Univ., Coimbatore, India ; Lakshmi, P.G.

Data mining has been defined as "The nontrivial extraction of implicit, previously unknown, and potentially useful information from data". Clustering is the automated search for group of related observations in a data set. The K-Means method is one of the most commonly used clustering techniques for a variety of applications. This paper proposes a method for making the K-Means algorithm more effective and efficient; so as to get better clustering with reduced complexity. In this paper, the most delegate algorithms K-Means and proposed K-Means were examined and analyzed based on their basic approach. The best algorithm in each category was found out based on their performance using uniform distribution data points. The accuracy of the algorithm was investigated during different execution of the program on the input data points. The elapsed time taken by proposed efficient K-Means is less than K-Means algorithm.

Published in:

Trendz in Information Sciences & Computing (TISC), 2010

Date of Conference:

17-19 Dec. 2010