مشخصات پژوهش

Data clustering is a common data mining techniques used in many applications such as data analysis and pattern recognition. K-means algorithm is the common clustering method which has fallen into the trap of local optimization and does not always create the optimized response to the problem, although having more advantages such as high speed. Artificial bee colony (ABC) is a novel biological-inspired optimization algorithm, having the advantage of less control parameters, strong global optimization ability and easy to implement. However, there are still some problems in ABC algorithm, likeinability to find the best solution from all possible solutions. Due to the large step of searching equation in ABC, the chance of skipping the true solution is high. Therefore, in this paper, to balance the diversity and convergence ability of the ABC, Mantegna Lévy distribution random walk is proposed and incorporated with ABC. The new algorithm, ABCL, brings the power of the Artificial Bee Colony algorithm to the K-means algorithm. The proposed algorithm benefits from Mantegna levy distribution to promote the ABC algorithm in solving the number of functional evaluation and also obtaining better convergence speed and high accuracy in a short time. We empirically evaluate the performance of our proposed method on nine standard datasets taken from the UCI Machine Learning Repository. The experimental results show that the proposed algorithm has ability to obtain better results in terms of convergence speed, accuracy, and reducing the number of functional evaluation.