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

Artificial Intelligence Applied to digital Email for forensic Application

The number of computer security incidents is growing exponentially and society’s collective ability to respond to this crisis is constrained by the lack of trained professionals. The increased use of the Internet and c...

Global Positioning System Data Logger.

A GPS tracking unit is a device that uses the Global Positioning System to determine the precise location of a vehicle, person, or other asset to which it is attached and to record the position of the asset at regular...

The current situation, future prospect of Poverty and inequality in Sudan

This research paper aims to address income poverty and inequality in Sudan. Poverty and inequality indicators were computed using both primary and secondary data sources. P-alpha equation, Povstat and Simsip models wer...

EVOLUTION OF DATA WAREHOUSE AND DATA MINING

Data warehouse is the requisite of all present competitive business communities‟ i.e. profitable and non-profitable as well as educational institutions where data is complex, huge and dynamic. The technology advent is...

HANDLING OF SYNCHRONIZED DATA USING JAVA/J2EE

This paper proposes use of a Vector Data Structure mechanism for Human Resource Management System over the Web Application. Array is the static memory allocation. It allocates the memory for the same data type in seque...

Download PDF file
  • EP ID EP26484
  • DOI -
  • Views 365
  • 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://www.europub.co.uk/articles/-A-26484