A simplex method-based social spider optimization algorithm for clustering analysis

Abstract Clustering is a popular data-analysis and data-mining technique that has been addressed in many contexts and by researchers in many disciplines. The K -means algorithm is one of the most popular clustering algorithms because of its simplicity and easiness in application. However, its performance depends strongly on the initial cluster centers used and can converge to local minima. To overcome these problems, many scholars have attempted to solve the clustering problem using meta-heuristic algorithms. However, as the dimensionality of a search space and the data contained within it increase, the problem of local optima entrapment and poor convergence rates persist; even the efficiency and effectiveness of these algorithms are often unacceptable. This study presents a simplex method-based social spider optimization (SMSSO) algorithm to overcome the drawbacks mentioned above. The simplex method is a stochastic variant strategy that increases the diversity of a population while enhancing the local search ability of the algorithm. The application of the proposed algorithm on a data-clustering problem using eleven benchmark datasets confirms the potential and effectiveness of the proposed algorithm. The experimental results compared to the K -means technique and other state-of-the-art algorithms show that the SMSSO algorithm outperforms the other algorithms in terms of accuracy, robustness, and convergence speed.

[1]  Leticia Avilés,et al.  Cooperative capture of large prey solves scaling challenge faced by spider societies , 2008, Proceedings of the National Academy of Sciences.

[2]  Leticia Avilés,et al.  The Evolution of Social Behavior in Insects and Arachnids: Causes and consequences of cooperation and permanent-sociality in spiders , 1997 .

[3]  Taher Niknam,et al.  An Efficient Hybrid Evolutionary Algorithm for Cluster Analysis , 2008 .

[4]  John Yen,et al.  A simplex genetic algorithm hybrid , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[5]  Abraham Kandel,et al.  Anomaly detection in web documents using crisp and fuzzy-based cosine clustering methodology , 2007, Inf. Sci..

[6]  Dervis Karaboga,et al.  A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..

[7]  B. Kulkarni,et al.  An ant colony approach for clustering , 2004 .

[8]  Jiawei Han,et al.  Efficient and Effective Clustering Methods for Spatial Data Mining , 1994, VLDB.

[9]  Silke A.T. Weber,et al.  Social-Spider Optimization-Based Artificial Neural Networks Training and Its Applications for Parkinson's Disease Identification , 2014, 2014 IEEE 27th International Symposium on Computer-Based Medical Systems.

[10]  Leticia Avilés,et al.  Sex-Ratio Bias and Possible Group Selection in the Social Spider Anelosimus eximius , 1986, The American Naturalist.

[11]  João Paulo Papa,et al.  A social-spider optimization approach for support vector machines parameters tuning , 2014, 2014 IEEE Symposium on Swarm Intelligence.

[12]  Liang Liao,et al.  MRI brain image segmentation and bias field correction based on fast spatially constrained kernel clustering approach , 2008, Pattern Recognit. Lett..

[13]  Reynaldo Gil-García,et al.  Dynamic hierarchical algorithms for document clustering , 2010, Pattern Recognit. Lett..

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

[15]  Roseli A. Francelin Romero,et al.  Unsupervised Breast Masses Classification through Optimum-Path Forest , 2015, 2015 IEEE 28th International Symposium on Computer-Based Medical Systems.

[16]  Kishida Kazuaki,et al.  Empirical Comparison of External Evaluation Measures for Document Clustering by Using Synthetic Data , 2014 .

[17]  Yongquan Zhou,et al.  Grey Wolf Optimizer Based on Powell Local Optimization Method for Clustering Analysis , 2015 .

[18]  Seyed Mohammad Mirjalili,et al.  Designing evolutionary feedforward neural networks using social spider optimization algorithm , 2015, Neural Computing and Applications.

[19]  Francisco Herrera,et al.  A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 Special Session on Real Parameter Optimization , 2009, J. Heuristics.

[20]  Marimuthu Palaniswami,et al.  Clustering ellipses for anomaly detection , 2011, Pattern Recognit..

[21]  Wilfrido Gómez-Flores,et al.  Automatic clustering using nature-inspired metaheuristics: A survey , 2016, Appl. Soft Comput..

[22]  G. R. Hext,et al.  Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation , 1962 .

[23]  Erik Valdemar Cuevas Jiménez,et al.  A new algorithm inspired in the behavior of the social-spider for constrained optimization , 2014, Expert Syst. Appl..

[24]  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..

[25]  Rui Wang,et al.  Flower Pollination Algorithm with Bee Pollinator for cluster analysis , 2016, Inf. Process. Lett..

[26]  Taher Niknam,et al.  A Hybrid Evolutionary Algorithm Based on ACO and SA for Cluster Analysis , 2008 .

[27]  Andries Petrus Engelbrecht,et al.  Particle swarm optimization method for image clustering , 2005, Int. J. Pattern Recognit. Artif. Intell..

[28]  Erik Valdemar Cuevas Jiménez,et al.  A swarm optimization algorithm inspired in the behavior of the social-spider , 2013, Expert Syst. Appl..

[29]  L. S. Rayor,et al.  Do social spiders cooperate in predator defense and foraging without a web? , 2011, Behavioral Ecology and Sociobiology.

[30]  Taher Niknam,et al.  An efficient hybrid approach based on PSO, ACO and k-means for cluster analysis , 2010, Appl. Soft Comput..

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

[32]  Andries Petrus Engelbrecht,et al.  Data clustering using particle swarm optimization , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[33]  Yongquan Zhou,et al.  An Improved Animal Migration Optimization Algorithm for Clustering Analysis , 2015 .

[34]  Bir Bhanu,et al.  Adaptive integrated image segmentation and object recognition , 2000, IEEE Trans. Syst. Man Cybern. Part C.

[35]  Xiangtao Li,et al.  An opposition-based differential evolution algorithm for permutation flow shop scheduling based on diversity measure , 2013, Adv. Eng. Softw..

[36]  Guan-zheng Tan,et al.  Hybrid particle swarm optimization with chaotic search for solving integer and mixed integer programming problems , 2014, Journal of Central South University.

[37]  Magdalene Marinaki,et al.  A Hybrid Particle Swarm Optimization Algorithm for Clustering Analysis , 2007, DaWaK.

[38]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

[39]  Henry Anaya-Sánchez,et al.  A document clustering algorithm for discovering and describing topics , 2010, Pattern Recognit. Lett..

[40]  Morteza Haghir Chehreghani,et al.  Novel meta-heuristic algorithms for clustering web documents , 2008, Appl. Math. Comput..

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

[42]  R. Fisher.  THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS , 1936 .

[43]  Mohamed S. Kamel,et al.  New algorithms for solving the fuzzy clustering problem , 1994, Pattern Recognit..

[44]  Hung T. Nguyen,et al.  Data Clustering Using Variants of Rapid Centroid Estimation , 2014, IEEE Transactions on Evolutionary Computation.

[45]  Rudy Hirschheim,et al.  A Comparative Framework of Data Modelling Paradigms and Approaches , 1987, Comput. J..