Abstract
Clustering is a technique employed for data mining and analysis. k-means is one of the algorithms utilized for clustering. However, the answer derived using this algorithm is dependent on the initial solution and hence easily retrieves the optimal local answers. To overcome the disadvantages of this algorithm, in this paper a combination of pollination of flowers algorithm and genetic algorithm, named FPAGA, is presented. Combination algorithms are used to diversify the search space of the solution and to improve its capability. To elaborate, crossover and discarding of pollens operator are utilized to increase the population diversity, while elitism operator is employed to improve the local search capabilities. Five datasets are selected to evaluate the performance of the proposed algorithm. The evaluation results demonstrate not only greater accuracy but also better stability compared to the FPA, GA, FA, DE, and k-means algorithms. Moreover, faster convergence is evident, according to the obtained statistical results.
Similar content being viewed by others
References
Bala D, Vijay K (2015) Predictive analytics and data mining, pp 371–406
Talbi EG (2009) Metaheuristics: from design to implementation, vol 74. Wiley, Hoboken
Bansal A, Goel S, Sharma M (2017) Improved k-mean clustering algorithm for prediction analysis using classification technique in data mining. Int J Comput Appl 157(6):0975–8887
Bhanu B, Peng J (2000) Adaptive integrated image segmentation and object recognition. IEEE Trans Syst Man Cybern Part C Appl Rev 30(4):427–441
Rao MR (1971) Cluster analysis and mathematical programming. J Am Stat Assoc 66(335):622–626
Hsu YF, Lin CY, Lin WY, Tsai CF (2009) Intrusion detection by machine learning: a review. Expert Syst Appl 36(10):11994–12000
Mani V, Omkar SN, Senthilnath J (2011) Clustering using firefly algorithm: performance study. Swarm Evolut Comput 1(3):164–171
Amiri B, Olamaie J, Niknam T (2008) A hybrid evolutionary algorithm based on ACO and SA for cluster analysis. J Appl Sci 8(15):2695–2702
Jayaraman VK, Kulkarni BD, Shelokar PS (2004) An ant colony approach for clustering. Anal Chim Acta 509(2):187–195
Cheng K, Kao Y (2006) An ACO-based clustering algorithm. In: International workshop on ant colony optimization and swarm intelligence, Springer, Berlin, Heidelberg, pp 340–347
Kennedy J (2011) Particle swarm optimization. In: Encyclopedia of machine learning. Springer, Boston, pp 760–766
Engelbrecht AP, Omran M, Salman A (2005) Particle swarm optimization method for image clustering. Int J Pattern Recognit Artif Intell 19(03):297–321
Guo J, Sun Y, Tang H and Zhao M (2014) Data clustering using particle swarm optimization, In Future Information Technology (pp. 607-612), Springer, Berlin, Heidelberg
Kao IW, Kao YT, Zahara E (2008) A hybridized approach to data clustering. Expert Syst Appl 34(3):1754–1762
Behera HS, Naik B, Nayak J (2017) Cluster analysis using firefly-based k-means algorithm: a combined approach, in computational intelligence in data mining. Springer, Singapore, pp 55–64
Abdel-Baset M, Hezam IM (2015) An effective hybrid flower pollination and genetic algorithm for constrained optimization problems. Adv Eng Technol Appl Int J 4:27–27
Abdel-Baset M, Abdel-Raouf O (2014) A new hybrid flower pollination algorithm for solving constrained global optimization problems. Int J Appl Oper Res Open Access J 4(2):1–13
Jensi R, Jiji GW (2015) Hybrid data clustering approach using k-means and flower pollination algorithm, arXiv preprint arXiv:1505.03236
Bensouyad M, Saidouni D (2015) A discrete flower pollination algorithm for graph coloring problem. In: 2015 IEEE 2nd international conference on cybernetics (CYBCONF), pp 151–155
Wang R, Zhou Y (2016) An improved flower pollination algorithm for optimal unmanned undersea vehicle path planning problem. Int J Pattern Recognit Artif Intell 30(04):1659010
Kaur D, Jyoti K (2013) Enhancement in the performance of K-means algorithm. Int J Comput Sci Commun Eng 2(1):29–32
Kiong SC, Meng OK, Pauline O (2017) An improved flower pollination algorithm with chaos theory for function optimization. In: AIP conference proceedings, vol 1870, no 1, p 050012, AIP Publishing
Agrawal S, Deb K, Meyarivan T and Pratap A (2000) A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In: International conference on parallel problem solving from nature. Springer, Berlin, pp 849–858
Basturk B, Karaboga D (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Global Optim 39(3):459–471
Islam MZ, Rahman MA (2014) A hybrid clustering technique combining a novel genetic algorithm with K-means. Knowl Based Syst 71:345–365
Asokan P, Karthikeyan S, Nickolas S and Page T (2015) A hybrid discrete firefly algorithm for solving multi-objective flexible job shop scheduling problems
Li X, Yin M (2013) An opposition-based differential evolution algorithm for permutation flow shop scheduling based on diversity measure. Adv Eng Softw 55:10–31
Žalik KR (2008) An efficient k′-means clustering algorithm. Pattern Recognit Lett 29(9):1385–1391
Blake CL, Merz CJ (1998) UCI repository of machine learning databases. University of California, Department of Information and Computer Science, Irvine
Amiri B, Niknam T (2010) An efficient hybrid approach based on PSO, ACO and k-means for cluster analysis. Appl Soft Comput 10(1):183–197
Anderson E (1955) The species problem in Iris Annals of the Missouri Botanical. Gardens 23:457–509
Fisher RA (1936) The use of multiple measurements in taxonomic problems. Annual Eugenics 7:179–188
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Fatahi, M., Moradi, S. An FPA and GA-based hybrid evolutionary algorithm for analyzing clusters. Knowl Inf Syst 62, 1701–1722 (2020). https://doi.org/10.1007/s10115-019-01413-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10115-019-01413-7