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 implementation of Triple DES (Data Encryption Standard) through Hash function

Cryptography, being one of the techniques that is handed out for securing a network. It is utilized by implementing many different algorithms. DES (Data Encryption Standard) is one of the most popular algorithms. But a...

Cost Estimation of Dynamic Programming Algorithm For Solution of Graphical as well as Network Problems for minimum path

The cost estimation for any algorithm defines the running time for that algorithm means to say how much time it taken to produce the solution. It defines the performance of algorithm. The dynamic programming approach i...

Enrollment Status of BRAC Primary School in Bangladesh: An Evaluation

BRAC has been a pioneer in the education arena. It has been working in the domain of primary education for almost two decades. BRAC has improved access and quality education for a significant number of children in Bang...

Kerberos Authentication Protocol Modeling Using NUSMV Model

Authentication is one of the biggest problem related to computer information security in the area of distributed environments. Various protocols are used for the authentication purpose such as Needham-Schroeder protoco...

DESIGN OF SMART HYBRID FUZZY PID CONTROLLER FOR DIFFERENT ORDER PROCESS CONTROL

This paper develops a hybrid fuzzy PID controller for different order process control. A smart hybrid fuzzy PID controller which comes from smart combination of classical PID and fuzzy PID controller. Combination is do...

Download PDF file
  • EP ID EP26484
  • DOI -
  • Views 363
  • 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