A NOVEL EVOLUTIONARY ALGORITHM FOR DATA CLUSTERING IN N DIMENSIONAL SPACE

Journal Title: Indian Journal of Computer Science and Engineering - Year 2011, Vol 2, Issue 6

Abstract

K-means clustering algorithm is one of the main algorithms applying in machine learning and pattern recognition. However, as the center of clusters are selected randomly and also due to the dependence of clustering result on the initial centers of clusters we may trap into local optima centers. In this paper a new genetic algorithm approach based on k-means algorithm is suggested in which the centers of clusters are selected better and in an appropriate manner. In order to increase the efficiency of this algorithm, in each stage, the layout of cluster centers which are in the form of chromosomes are changed with respect to the best chromosome. By estimation of results of the proposed approach on a standard data set and also comparison of this algorithm with other related algorithms we can show that our approach is more efficient than k-means algorithm and other algorithms which have been selected in this paper for comparison purposes.

Authors and Affiliations

Roohollah Etemadi , Alireza Hajieskandar

Keywords

Related Articles

SOFTWARE RELIABILITY OF PROFICIENT ENACTMENT

A software reliability exemplary projects snags the random process as disillusionments which were the culmination yield of two progressions: emerging faults and initial state values. The predominant classification uses t...

DETECTION AND CLASSIFICATION OF TUMORS IN CT IMAGES

Image segmentation is the process of partitioning a digital image into multiple segments or set of pixels. The objective of image segmentation is to group pixels into a prominent image region. In this paper, segmentation...

Analyzing Throughput of TCP in IEEE 802.11 Based Ad-hoc Networks

In order to allow programmers to follow conventional techniques while creating applications that uses an internet, software in the internet must provide the same semantics as a conventional computer system, it means it m...

An Optimized Secure Communication Using VLR-GS-BU on Wireless Network

A novel protocol to achieve privacy-preserving universal authentication protocol for wireless communications called Priauth. to secure the communication as the data are sensitive or it requires the users to pay for it. I...

AN EFFICIENT GESTURE RECOGNITION TOOLKIT

The rapid growth of computing has made effective human-computer interaction essential. It is important for the growing number of computer users whose schedules will not allow the elaborate training and experience that wa...

Download PDF file
  • EP ID EP108400
  • DOI -
  • Views 117
  • Downloads 0

How To Cite

Roohollah Etemadi, Alireza Hajieskandar (2011). A NOVEL EVOLUTIONARY ALGORITHM FOR DATA CLUSTERING IN N DIMENSIONAL SPACE. Indian Journal of Computer Science and Engineering, 2(6), 902-908. https://europub.co.uk/articles/-A-108400