An Efficient Centroid Selection Algorithm for K-means Clustering

Abstract

This paper, we proposes an algorithm for performing data partitioning along the data axis with the highest variance to improve the accuracy. The data partitioning tries to divide data space into small cells or clusters where inter cluster distance are large and intra cluster distance are small as possible. Cells are partitioned one at a time until the number of cells equals to the predefined number of clusters, K. The centers of the K cells become the initial cluster centers for K-means. The experimental results shows that the proposed algorithm will be more effective and efficient converge to better clustering results than the existing clustering.

Authors and Affiliations

Saranya and Dr. Punithavalli

Keywords

Related Articles

An Efficient Model to Improve Software Development Process and Quality Assurance

Software Process Improvement is a systematic approach and continuous improvement of software development organization’s ability to produce and deliver quality software within time and budget constraints. This paper wor...

“M-LearNiNg” - A Buzzword in Computer Technology

With the exponential development in technology, there is always the danger that the equilibrium between technology and learning is disturbed. But Mobile Learning or short M-Learning creates completely new possibilities...

AN AUTOMATIC BACTERIAL COLONY COUNTER

Bacterial colony counting is useful in many areas e.g. Disinfectants are used to kill harmful microorganismsin many different applications. They are used in veterinary practice to help to preventthe spread of infectiou...

Hybrid Rough Genetic algorithm for Selecting Optimal Routes

Routing protocols in most networks use the length of paths or the minimum-hops that can be achieved, as the routing metric. This led to the motivation to propose a new algorithm that satisfies multiple constraints for...

The Influence of Facilitation, Low Transaction Cost and Convenience on Customer’s turnover IntentIon from Conventional to Web-Based Banking

With the advancement of technology the banking sector has been dramatically changed from conventional way of banking to the internet banking i.e. web based banking. This advancement of technology has been totally chang...

Download PDF file
  • EP ID EP26484
  • DOI -
  • Views 373
  • Downloads 8

How To Cite

Saranya and Dr. Punithavalli (2011). An Efficient Centroid Selection Algorithm for K-means Clustering. International Journal of Engineering, Science and Mathematics, 1(3), -. https://europub.co.uk/articles/-A-26484