A Whole Crow Search Algorithm for Solving Data Clustering

Abstract

Data clustering is a well-known data mining approach that usually used to minimizes the intra distance but maximizes inter distance of each data center. The cluster problem has been proved to be an NP-hard problem. In this paper, a hybrid algorithm based on Whole optimization algorithm (WOA) and Crow search algorithm (CSA) is proposed, namely HWCA. The HWCA algorithm has the advantages of the search strategy of the WOA and CSA. In addition to, there are two operators used to improve the quality of solution, namely hybrid individual operator and enhance diversity operator. The hybrid individual operator is used to exchanges individuals from the WOA and CSA systems by using the roulette wheel approach. In other hand, the HWCA performs enhance diversity operator to improve the quality of each system. More over, the HWCA is incorporated with center optimization strategy to enhance diversity of each system. In the performance evaluation, the proposed MPGO algorithm was comparison WOA and CSA algorithm with six well-known UCI benchmarks. The results show that the proposed algorithm has a higher measure of accuracy rate with comparison algorithms.