An efficient approach based on differential evolution algorithm for data clustering

Clustering plays an essential role for data analysis and it has been widely used in different fields like data mining, machine learning and pattern recognition.Clustering problem divides some data, which is more similar to each other in terms of parameters under consideration.One of available methods about this area is k-means algorithm.Despite dependency of this algorithm on initial condition and convergence to local optimal points, it classifies n data to k clusters with high speed.Since we encounter a huge volume of data in clustering problems, one of suitable methods for optimal clustering is to use a meta-heuristic algorithm, which improves clustering operation.In this paper, differential evolution algorithm is utilized for solving available problems in k-means algorithm.In this paper, meta-heuristic algorithm has been used for solving data clustering problems.The applied algorithm has been compared with k-means algorithm on six known dataset from UCI database.Results show that this algorithm achieves better clustering than k-means algorithm.

Abstract licence: CC BY

17 more references, whose wording the paper’s licence keeps private.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.