Sample Index Based Encoding for Clustering Using Evolutionary Computation

Clustering is a commonly used unsupervised machine learning method, which automatically organized data into different clusters according to their similarities. In this paper, we carried out a throughout research on evolutionary computation based clustering. This paper proposed a sample index based encoding method, which significantly reduces the search space of evolutionary computation so the clustering algorithm converged quickly. Evolutionary computation has a good global search ability while the traditional clustering method k-means has a better capability at local search. In order to combine the strengths of both, this paper researched on the effect of initializing k-means by evolutionary computation algorithms. Experiments were conducted on five commonly used evolutionary computation algorithms. Experimental results show that the sample index based encoding method and evolutionary computation initialized k-means both perform well and demonstrate great potential.

[1]  Sandra Paterlini,et al.  Differential evolution and particle swarm optimisation in partitional clustering , 2006, Comput. Stat. Data Anal..

[2]  Ujjwal Maulik,et al.  Genetic algorithm-based clustering technique , 2000, Pattern Recognit..

[3]  H. Modares,et al.  Combining PSO and k-means to enhance data clustering , 2008, 2008 International Symposium on Telecommunications.

[4]  Karel F. Liem,et al.  Evolutionary Strategies and Morphological Innovations: Cichlid Pharyngeal Jaws , 1973 .

[5]  Ying Tan,et al.  Fireworks Algorithm for Optimization , 2010, ICSI.

[6]  Ying Tan,et al.  Enhanced Fireworks Algorithm , 2013, 2013 IEEE Congress on Evolutionary Computation.

[7]  Ujjwal Maulik,et al.  An evolutionary technique based on K-Means algorithm for optimal clustering in RN , 2002, Inf. Sci..

[8]  Mohammad Reza Meybodi,et al.  Efficient stochastic algorithms for document clustering , 2013, Inf. Sci..

[9]  J. A. Hartigan,et al.  A k-means clustering algorithm , 1979 .

[10]  Ying Tan,et al.  Advances in Swarm Intelligence , 2016, Lecture Notes in Computer Science.

[11]  S. C. Johnson.  Hierarchical clustering schemes , 1967, Psychometrika.

[12]  Ching-Yi Chen,et al.  Particle swarm optimization algorithm and its application to clustering analysis , 2004, 2012 Proceedings of 17th Conference on Electrical Power Distribution.

[13]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[14]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[15]  T. Moon.  The expectation-maximization algorithm , 1996, IEEE Signal Process. Mag..

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

[17]  Swagatam Das,et al.  Automatic Clustering Using an Improved Differential Evolution Algorithm , 2007 .

[18]  Enrique Alba,et al.  The jMetal framework for multi-objective optimization: Design and architecture , 2010, IEEE Congress on Evolutionary Computation.

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

[20]  Geoffrey E. Hinton,et al.  Reducing the Dimensionality of Data with Neural Networks , 2006, Science.

[21]  Michael McGill,et al.  Introduction to Modern Information Retrieval , 1983 .