Affiliation:
1. Ain Shams University, Egypt
Abstract
This chapter proposed different hybrid clustering methods based on combining particle swarm optimization (PSO), gravitational search algorithm (GSA) and free parameters central force optimization (CFO) with each other and with the k-means algorithm. The proposed methods were applied on 5 real datasets from the university of California, Irvine (UCI) machine learning repository. Comparative analysis was done in terms of three measures; the sum of intra cluster distances, the running time and the distances between the clusters centroids. The initial population for the used algorithms were enhanced to minimize the sum of intra cluster distances. Experimental results show that, increasing the number of iterations doesn't have a noticeable impact on the sum of intra cluster distances while it has a negative impact on the running time. K-means combined with GSA (KM-GSA), PSO combined with GSA (PSO-GSA) gave the best performance according to the sum of intra cluster distances while K-means combined with PSO (KM-PSO) and KM-GSA were the best in terms of the running time. Finally, KM-GSA and GSA have the best performance.
Reference57 articles.
1. Abdel-Raouf, O., Abdel-Baset, M., & El-henawy, I. (2014). A New Hybrid Flower Pollination Algorithm for Solving Constrained Global Optimization Problems. Advanced Engineering Technology and Application, 21-28.
2. Abraham, A., Das, S., & Konar, A. (2006). Document clustering using differential evolution. IEEE Congress on Evolutionary Computation, 1784-1791.
3. A Tabu search approach to the clustering problem
4. Bache, K., & Lichman, M. (n.d.). UCI machine learning respository. University of California, School of Information and Computer Science. Retrieved 2012, from http://archive.ics.uci.edu/ml/datasets.html
5. Analysis of Particle Swarm Optimization Algorithm
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献