An improved differential evolution algorithm using Archimedean spiral and neighborhood search based mutation approach for cluster analysis

Abstract This study proposes an improved Differential Evolution (DE) algorithm utilizing Archimedean Spiral, Mantegna Levy Distribution, and Neighborhood Search (NS). The proposed algorithm is denoted as Adaptive Differential Evolution with Neighborhood Search (ADENS). The aim of the ADENS algorithm is to enhance the convergence speed and keeping a balance between exploration and exploitation of the DE algorithm. It uses a new mutation strategy to generate robust solutions by combining the Archimedean Spiral (AS) with the Mantegna Levy flight. In order to enhance the efficiency of ADENS, a replacement method combines Levy flight with neighborhood search to generate solutions that replace poorly performing ones. A self-adaptive strategy is applied to fine-tune one of the control parameters of DE and an initialization method is employed to initialize the algorithm. These strategies help the algorithm achieve good efficiency in terms of convergence speed and both local and global search. The performance is evaluated using twelve well-known standard data sets to show the algorithm’s superior performance, confirmed to be statistically significant. In order to test the proposed approach statistically, this paper applied Wilcoxon ranked sum test as well as Friedman test. Our results also shed light on the comparative performance of some recently published clustering heuristics. The results show that the algorithm is a robust algorithm and has a great superiority with respect to the employed algorithms. The proposed algorithm can be applied in different applications such as medical diagnosis and image segmentation according to the conducted experiments.

[1]  Mohanad Albughdadi,et al.  Variance-based differential evolution algorithm with an optional crossover for data clustering , 2019, Appl. Soft Comput..

[2]  Michael Krauthammer,et al.  Complementary ensemble clustering of biomedical data , 2013, J. Biomed. Informatics.

[3]  Shokri Z. Selim,et al.  K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Alex Alves Freitas,et al.  A Survey of Evolutionary Algorithms for Clustering , 2009, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[5]  Catherine Blake,et al.  UCI Repository of machine learning databases , 1998 .

[6]  Mengnan Tian,et al.  Differential evolution with neighborhood-based adaptive evolution mechanism for numerical optimization , 2019, Inf. Sci..

[7]  Yunlong Zhu,et al.  A Clustering Approach Using Cooperative Artificial Bee Colony Algorithm , 2010 .

[8]  Anil K. Jain,et al.  Data clustering: a review , 1999, CSUR.

[9]  Tiranee Achalakul,et al.  The best-so-far selection in Artificial Bee Colony algorithm , 2011, Appl. Soft Comput..

[10]  Cheng-Yan Kao,et al.  Applying the genetic approach to simulated annealing in solving some NP-hard problems , 1993, IEEE Trans. Syst. Man Cybern..

[11]  Jing Li,et al.  Ant clustering algorithm with K-harmonic means clustering , 2010, Expert Syst. Appl..

[12]  Wojciech Kwedlo,et al.  A clustering method combining differential evolution with the K-means algorithm , 2011, Pattern Recognit. Lett..

[13]  Seyed Mohammad Mirjalili,et al.  Moth-flame optimization algorithm: A novel nature-inspired heuristic paradigm , 2015, Knowl. Based Syst..

[14]  Anil K. Jain.  Data clustering: 50 years beyond K-means , 2010, Pattern Recognit. Lett..

[15]  Surjeet Dalal,et al.  An Enhanced Bat Algorithm for Data Clustering Problems , 2017 .

[16]  R. Jensi,et al.  An improved krill herd algorithm with global exploration capability for solving numerical function optimization problems and its application to data clustering , 2016, Appl. Soft Comput..

[17]  Millie Pant,et al.  Magnetic optimization algorithm for data clustering , 2017, Pattern Recognit. Lett..

[18]  Surendra Kumar,et al.  Application of ant colony, genetic algorithm and data mining-based techniques for scheduling , 2009 .

[19]  Babak Nasiri,et al.  A Novel History-driven Artificial Bee Colony Algorithm for Data Clustering , 2018, Appl. Soft Comput..

[20]  F. Wilcoxon.  Individual Comparisons by Ranking Methods , 1945 .

[21]  Sam Kwong,et al.  Gbest-guided artificial bee colony algorithm for numerical function optimization , 2010, Appl. Math. Comput..

[22]  Raymond Chiong,et al.  Dynamic Function Optimization: The Moving Peaks Benchmark , 2013, Metaheuristics for Dynamic Optimization.

[23]  Md. Zakirul Alam Bhuiyan,et al.  A Survey on Deep Learning in Big Data , 2017, 22017 IEEE International Conference on Computational Science and Engineering (CSE) and IEEE International Conference on Embedded and Ubiquitous Computing (EUC).

[24]  G. M. Komaki,et al.  Grey Wolf Optimizer algorithm for the two-stage assembly flow shop scheduling problem with release time , 2015, J. Comput. Sci..

[25]  R. Mantegna,et al.  Fast, accurate algorithm for numerical simulation of Lévy stable stochastic processes. , 1994, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[26]  Sumit Kumar,et al.  A new meta-heuristic algorithm based on chemical reactions for partitional clustering problems , 2019, Evol. Intell..

[27]  Nadjet Kamel,et al.  A new quantum chaotic cuckoo search algorithm for data clustering , 2018, Expert Syst. Appl..

[28]  Zülal Güngör,et al.  K-harmonic means data clustering with simulated annealing heuristic , 2007, Appl. Math. Comput..

[29]  Li-Chun Wang,et al.  Distributed clustering algorithms for data-gathering in wireless mobile sensor networks , 2007, J. Parallel Distributed Comput..

[30]  Richard Millham,et al.  Elephant search algorithm on data clustering , 2016, 2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD).

[31]  Chang Sup Sung,et al.  A tabu-search-based heuristic for clustering , 2000, Pattern Recognit..

[32]  Cong Wang,et al.  Chaotic ant swarm approach for data clustering , 2012, Appl. Soft Comput..

[33]  A. Kai Qin,et al.  Self-adaptive differential evolution algorithm for numerical optimization , 2005, 2005 IEEE Congress on Evolutionary Computation.

[34]  Ilya Pavlyukevich.  Lévy flights, non-local search and simulated annealing , 2007, J. Comput. Phys..

[35]  Abdolreza Hatamlou,et al.  In search of optimal centroids on data clustering using a binary search algorithm , 2012, Pattern Recognit. Lett..

[36]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[37]  Xin-She Yang,et al.  Metaheuristic Optimization: Algorithm Analysis and Open Problems , 2011, SEA.

[38]  Umeshwar Dayal,et al.  K-Harmonic Means - A Spatial Clustering Algorithm with Boosting , 2000, TSDM.

[39]  Daoliang Li,et al.  An improved KK-means clustering algorithm for fish image segmentation , 2013, Math. Comput. Model..

[40]  Francisco Herrera,et al.  Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: Experimental analysis of power , 2010, Inf. Sci..

[41]  K. alik.  An efficient k'-means clustering algorithm , 2008 .

[42]  Avinash Chandra Pandey,et al.  Data clustering using hybrid improved cuckoo search method , 2016, 2016 Ninth International Conference on Contemporary Computing (IC3).

[43]  Lingling Huang,et al.  A global best artificial bee colony algorithm for global optimization , 2012, J. Comput. Appl. Math..

[44]  P. N. Suganthan,et al.  Differential Evolution: A Survey of the State-of-the-Art , 2011, IEEE Transactions on Evolutionary Computation.

[45]  Xiaohui Yan,et al.  A new approach for data clustering using hybrid artificial bee colony algorithm , 2012, Neurocomputing.

[46]  H. Jennings.  On the Significance of the Spiral Swimming of Organisms , 1901, The American Naturalist.

[47]  Farzin Modarres Khiyabani,et al.  A whale optimization algorithm (WOA) approach for clustering , 2018 .

[48]  Sirapat Chiewchanwattana,et al.  Enhancing modified cuckoo search by using Mantegna Lévy flights and chaotic sequences , 2013, The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE).

[49]  Ning Zhu,et al.  A dynamic shuffled differential evolution algorithm for data clustering , 2015, Neurocomputing.

[50]  Pradnya A. Vikhar,et al.  Evolutionary algorithms: A critical review and its future prospects , 2016, 2016 International Conference on Global Trends in Signal Processing, Information Computing and Communication (ICGTSPICC).

[51]  Ali Wagdy Mohamed,et al.  Adaptive guided differential evolution algorithm with novel mutation for numerical optimization , 2017, International Journal of Machine Learning and Cybernetics.

[52]  Teofilo F. Gonzalez,et al.  On the computational complexity of clustering and related problems , 1982 .

[53]  Amit Konar,et al.  Differential Evolution Using a Neighborhood-Based Mutation Operator , 2009, IEEE Transactions on Evolutionary Computation.

[54]  Qin He,et al.  A Review of Clustering Algorithms as Applied in IR , 1999 .

[55]  Mingwen Wang,et al.  Enhancing the modified artificial bee colony algorithm with neighborhood search , 2017, Soft Comput..

[56]  Andries Petrus Engelbrecht,et al.  Self-adaptive Differential Evolution , 2005, CIS.

[57]  Marjan Mernik,et al.  Exploration and exploitation in evolutionary algorithms: A survey , 2013, CSUR.

[58]  Sraban Kumar Mohanty,et al.  DK-means: a deterministic K-means clustering algorithm for gene expression analysis , 2017, Pattern Analysis and Applications.

[59]  Long Quan,et al.  A novel data clustering algorithm based on modified gravitational search algorithm , 2017, Eng. Appl. Artif. Intell..

[60]  Ian H. Witten,et al.  Data mining: practical machine learning tools and techniques, 3rd Edition , 1999 .

[61]  Pavel Boytchev,et al.  North Pole Adventures , 2002, Int. J. Comput. Math. Learn..

[62]  Manoj Thakur,et al.  A new genetic algorithm for global optimization of multimodal continuous functions , 2014, J. Comput. Sci..

[63]  Francisco Herrera,et al.  A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms , 2011, Swarm Evol. Comput..