Data Clustering Using Levy Flight and Local Memory Bees Algorithm

One of the most popular clustering algorithms is K- means cluster due to its simplicity and efficiency. Although clustering using K-means algorithm is fast and produces good results, it still has a number of limitations including initial centroid selection and local optima. The purpose of this research is to develop a hybrid algorithm that address k-means clustering limitations and improve its performance by finding optimal cluster centre. In this paper, Lévy-flights or Lévy motion is one of non-Gaussian random processes used to solve the initial centroid problem. Bees algorithm is a population-based algorithm which has been proposed to overcome the local optima problem, used along with its local memory to enhance the efficiency of K-means. The proposed algorithm applied to different datasets and compared with K-means and basic Bees algorithm. The results show that the proposed algorithm gives better performance and avoid local optima problem.