A powerful and efficient evolutionary optimization algorithm based on stem cells algorithm for data clustering

10Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

There are many ways to divide datasets into some clusters. One of most popular data clustering algorithms is K-means algorithm which uses the distance criteria for measuring the data correlation. To do that, we should know in advance the number of classes (K) and choose K data points as an initial set to run the algorithm. However, the choice of initial points is a main problem in this algorithm which may cause the algorithm to converge to a local minimum. Some other data clustering algorithms have been proposed to overcome this problem. The methods are Genetic algorithm (GA), Ant Colony Optimization (ACO), PSO algorithm, and ABC algorithms. In this paper, we employ the Stem Cells Optimization algorithm for data clustering. The algorithm was inspired by behavior of natural stem cells in the human body. We developed a new data clustering based on this new optimization scheme which has the advantages such as high convergence rate and easy implementation process. It also avoids local minimums in an intelligent manner. The experimental results obtained by using the new algorithm on different well-known test datasets compared with those obtained using other mentioned methods demonstrate the better accuracy and high speed of the new algorithm.

Cite

CITATION STYLE

APA

Taherdangkoo, M., Yazdi, M., & Bagheri, M. H. (2012). A powerful and efficient evolutionary optimization algorithm based on stem cells algorithm for data clustering. Open Computer Science, 2(1). https://doi.org/10.2478/s13537-012-0002-z

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free