a hybrid data clustering algorithm using modified krill herd algorithm and k-means

Data clustering is the process of partitioning a set of data objects into meaning clusters or groups. due to the vast usage of clustering algorithms in many fields, a lot of research is still going on to find the best and efficient clustering algorithm to partition the data items. k-means is simple and easy to implement, but it suffers from initialization of cluster center and hence trapped in local optimum. in this paper, a new hybrid data clustering approach which combines the modified krill herd and k-means algorithms, named as k-mkh, is proposed. k-mkh algorithm utilizes the power of quick convergence behaviour of k-means and efficient global exploration of krill herd and random phenomenon of levy flight method. the krill-herd algorithm is modified by incorporating levy flight into it to improve the global exploration. the proposed algorithm is tested on artificial and real life datasets. the simulation results are compared with other methods such as k-means, particle swarm optimization (pso), original krill herd (kh), hybrid k-means and kh. also the proposed algorithm is compared with other evolutionary algorithms such as hybrid modified cohort intelligence and k-means (k-mci), simulated annealing (sa), ant colony optimization (aco), genetic algorithm (ga), tabu search (ts), honey bee mating optimization (hbmo) and k-means++. the comparison shows that the proposed algorithm improves the clustering results and has high convergence speed.