# 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. 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 in to 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.

منابع مشابه

## Persistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm

Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...

متن کامل## Krill Herd Clustering Algorithm using DBSCAN Technique

The hybrid approach is proposed to show that the clusters also show the swarm behavior. Krill herd algorithm is used to show the simulation of the herding behavior of the krill individuals. Density based approach is used for discovering the clusters and to show the region with sufficiently high density into clusters of krill individuals that of the arbitrary shape in environment. The minimum di...

متن کامل## Clustering Using an Improved Krill Herd Algorithm

In recent years, metaheuristic algorithms have been widely used in solving clustering problems because of their good performance and application effects. krill herd algorithm (KHA) is a new effective algorithm to solve optimization problems based on the imitation of krill individual behavior, and it is proven to perform better than other swarm intelligence algorithms. However, there are some we...

متن کامل## Simultaneous Pattern and Data Clustering Using Modified K-Means Algorithm

In data mining and knowledge discovery, for finding the significant correlation among events Pattern discovery (PD) is used. PD typically produces an overwhelming number of patterns. Since there are too many patterns, it is difficult to use them to further explore or analyze the data. To address the problems in Pattern Discovery, a new method that simultaneously clusters the discovered patterns...

متن کامل## An efficient hybrid algorithm based on modified imperialist competitive algorithm and K-means for data clustering

Clustering techniques have received attention in many fields of study such as engineering, medicine, biology and data mining. The aim of clustering is to collect data points. The K-means algorithm is one of the most common techniques used for clustering. However, the results of K-means depend on the initial state and converge to local optima. In order to overcome local optima obstacles, a lot o...

متن کامل## persistent k-means: stable data clustering algorithm based on k-means algorithm

identifying clusters or clustering is an important aspect of data analysis. it is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. it is a main task of exploratory data mining, and a common technique for statistical data analysis this paper proposed an improved version of k-means algorithm, namely persistent k...

متن کاملمنابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}

عنوان ژورنال

دوره 5 شماره 2

صفحات 93- 106

تاریخ انتشار 2019-05-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023