A survey: hybrid evolutionary algorithms for cluster analysis

  • Authors:
  • Mohamed Jafar Abul Hasan;Sivakumar Ramakrishnan

  • Affiliations:
  • Department of Computer Science, A.V.V.M. Sri Pushpam College (Autonomous), Poondi, India;Department of Computer Science, A.V.V.M. Sri Pushpam College (Autonomous), Poondi, India

  • Venue:
  • Artificial Intelligence Review
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Clustering is a popular data analysis and data mining technique. It is the unsupervised classification of patterns into groups. Many algorithms for large data sets have been proposed in the literature using different techniques. However, conventional algorithms have some shortcomings such as slowness of the convergence, sensitive to initial value and preset classed in large scale data set etc. and they still require much investigation to improve performance and efficiency. Over the last decade, clustering with ant-based and swarm-based algorithms are emerging as an alternative to more traditional clustering techniques. Many complex optimization problems still exist, and it is often very difficult to obtain the desired result with one of these algorithms alone. Thus, robust and flexible techniques of optimization are needed to generate good results for clustering data. Some algorithms that imitate certain natural principles, known as evolutionary algorithms have been used in a wide variety of real-world applications. Recently, much research has been proposed using hybrid evolutionary algorithms to solve the clustering problem. This paper provides a survey of hybrid evolutionary algorithms for cluster analysis.