EKEGWO: Enhanced Kernel-Based Exponential Grey Wolf Optimizer for Bi-Objective Data Clustering

2019 ◽  
Vol 27 (04) ◽  
pp. 669-688 ◽  
Author(s):  
Amolkumar Narayan Jadhav ◽  
Gomathi N.
Keyword(s):  
Data Clustering ◽  
Clustering Algorithm ◽  
Fitness Function ◽  
Multidimensional Data ◽  
Grey Wolf Optimizer ◽  
Grey Wolf ◽  
Widespread Application ◽  
Clustering Techniques ◽  
Cluster Distance ◽  
F Measure

The widespread application of clustering in various fields leads to the discovery of different clustering techniques in order to partition multidimensional data into separable clusters. Although there are various clustering approaches used in literature, optimized clustering techniques with multi-objective consideration are rare. This paper proposes a novel data clustering algorithm, Enhanced Kernel-based Exponential Grey Wolf Optimization (EKEGWO), handling two objectives. EKEGWO, which is the extension of KEGWO, adopts weight exponential functions to improve the searching process of clustering. Moreover, the fitness function of the algorithm includes intra-cluster distance and the inter-cluster distance as an objective to provide an optimum selection of cluster centroids. The performance of the proposed technique is evaluated by comparing with the existing approaches PSC, mPSC, GWO, and EGWO for two datasets: banknote authentication and iris. Four metrics, Mean Square Error (MSE), F-measure, rand and jaccord coefficient, estimates the clustering efficiency of the algorithm. The proposed EKEGWO algorithm can attain an MSE of 837, F-measure of 0.9657, rand coefficient of 0.8472, jaccord coefficient of 0.7812, for the banknote dataset.

KERNEL-BASED EXPONENTIAL GREY WOLF OPTIMIZER FOR RAPID CENTROID ESTIMATION IN DATA CLUSTERING

2016 ◽  
Vol 78 (11) ◽  
Author(s):  
Amolkumar Narayan Jadhav ◽  
Gomathi N.
Keyword(s):  
Data Clustering ◽  
Objective Evaluation ◽  
Multidimensional Data ◽  
Grey Wolf Optimizer ◽  
Similar Data ◽  
Grey Wolf ◽  
Data Set ◽  
Wide Range ◽  
Centroid Estimation ◽  
Two Parameters

Clustering finds variety of application in a wide range of disciplines because it is mostly helpful for grouping of similar data objects together. Due to the wide applicability, different algorithms have been presented in the literature for segmenting large multidimensional data into discernible representative clusters. Accordingly, in this paper, Kernel-based exponential grey wolf optimizer (KEGWO) is developed for rapid centroid estimation in data clustering. Here, KEGWO is newly proposed to search the cluster centroids with a new objective evaluation which considered two parameters called logarithmic kernel function and distance difference between two top clusters. Based on the new objective function and the modified KEGWO algorithm, centroids are encoded as position vectors and the optimal location is found for the final clustering. The proposed KEGWO algorithm is evaluated with banknote authentication Data Set, iris dataset and wine dataset using four metrics such as, Mean Square Error, F-measure, Rand co-efficient and jaccord coefficient. From the outcome, we proved that the proposed KEGWO algorithm outperformed the existing algorithms.   

A Grey Wolf Optimizer for Text Document Clustering

2018 ◽  
Vol 29 (1) ◽  
pp. 814-830 ◽  
Author(s):  
Hasan Rashaideh ◽  
Ahmad Sawaie ◽  
Mohammed Azmi Al-Betar ◽  
Laith Mohammad Abualigah ◽  
Mohammed M. Al-laham ◽  
...  
Keyword(s):  
Clustering Algorithm ◽  
Document Clustering ◽  
Text Clustering ◽  
The Other ◽  
Grey Wolf Optimizer ◽  
Data Sets ◽  
Complex Data ◽  
Grey Wolf ◽  
Clustering Methods ◽  
F Measure

Abstract Text clustering problem (TCP) is a leading process in many key areas such as information retrieval, text mining, and natural language processing. This presents the need for a potent document clustering algorithm that can be used effectively to navigate, summarize, and arrange information to congregate large data sets. This paper encompasses an adaptation of the grey wolf optimizer (GWO) for TCP, referred to as TCP-GWO. The TCP demands a degree of accuracy beyond that which is possible with metaheuristic swarm-based algorithms. The main issue to be addressed is how to split text documents on the basis of GWO into homogeneous clusters that are sufficiently precise and functional. Specifically, TCP-GWO, or referred to as the document clustering algorithm, used the average distance of documents to the cluster centroid (ADDC) as an objective function to repeatedly optimize the distance between the clusters of the documents. The accuracy and efficiency of the proposed TCP-GWO was demonstrated on a sufficiently large number of documents of variable sizes, documents that were randomly selected from a set of six publicly available data sets. Documents of high complexity were also included in the evaluation process to assess the recall detection rate of the document clustering algorithm. The experimental results for a test set of over a part of 1300 documents showed that failure to correctly cluster a document occurred in less than 20% of cases with a recall rate of more than 65% for a highly complex data set. The high F-measure rate and ability to cluster documents in an effective manner are important advances resulting from this research. The proposed TCP-GWO method was compared to the other well-established text clustering methods using randomly selected data sets. Interestingly, TCP-GWO outperforms the comparative methods in terms of precision, recall, and F-measure rates. In a nutshell, the results illustrate that the proposed TCP-GWO is able to excel compared to the other comparative clustering methods in terms of measurement criteria, whereby more than 55% of the documents were correctly clustered with a high level of accuracy.

A Modified Grey Wolf Optimizer Based Data Clustering Algorithm

2020 ◽  
Vol 35 (1) ◽  
pp. 63-79
Author(s):  
Ramin Ahmadi ◽  
Gholamhossein Ekbatanifard ◽  
Peyman Bayat
Keyword(s):  
Data Clustering ◽  
Clustering Algorithm ◽  
Grey Wolf Optimizer ◽  
Grey Wolf

An elephant herd grey wolf optimization (EHGWO) algorithm for load balancing in cloud

2020 ◽  
Vol 16 (3) ◽  
pp. 259-277
Author(s):  
Pooja Arora ◽  
Anurag Dixit
Keyword(s):  
Cloud Computing ◽  
Load Balancing ◽  
System Performance ◽  
Virtual Machines ◽  
Fitness Function ◽  
Optimization Technique ◽  
Grey Wolf Optimizer ◽  
Grey Wolf ◽  
Content Type ◽  
Computing Model

Purpose The advancements in the cloud computing has gained the attention of several researchers to provide on-demand network access to users with shared resources. Cloud computing is important a research direction that can provide platforms and softwares to clients using internet. However, handling huge number of tasks in cloud infrastructure is a complicated task. Thus, it needs a load balancing (LB) method for allocating tasks to virtual machines (VMs) without influencing system performance. This paper aims to develop a technique for LB in cloud using optimization algorithms. Design/methodology/approach This paper proposes a hybrid optimization technique, named elephant herding-based grey wolf optimizer (EHGWO), in the cloud computing model for LB by determining the optimal VMs for executing the reallocated tasks. The proposed EHGWO is derived by incorporating elephant herding optimization (EHO) in grey wolf optimizer (GWO) such that the tasks are allocated to the VM by eliminating the tasks from overloaded VM by maintaining the system performance. Here, the load of physical machine (PM), capacity and load of VM is computed for deciding whether the LB has to be done or not. Moreover, two pick factors, namely, task pick factor (TPF) and VM pick factor (VPF), are considered for choosing the tasks for reallocating them from overloaded VM to underloaded VM. The proposed EHGWO decides the task to be allocated in the VM based on the newly derived fitness functions. Findings The minimum load and makespan obtained in the existing methods, constraint measure based LB (CMLB), fractional dragonfly based LB algorithm (FDLA), EHO, GWO and proposed EHGWO for the maximum number of VMs is illustrated. The proposed EHGWO attained minimum makespan with value 814,264 ns and minimum load with value 0.0221, respectively. Meanwhile, the makespan values attained by existing CMLB, FDLA, EHO, GWO, are 318,6896 ns, 230,9140 ns, 1,804,851 ns and 1,073,863 ns, respectively. The minimum load values computed by existing methods, CMLB, FDLA, EHO, GWO, are 0.0587, 0.026, 0.0248 and 0.0234. On the other hand, the proposed EHGWO with minimum load value is 0.0221. Hence, the proposed EHGWO attains maximum performance as compared to the existing technique. Originality/value This paper illustrates the proposed LB algorithm using EHGWO in a cloud computing model using two pitch factors, named TPF and VPF. For initiating LB, the tasks assigned to the overloaded VM are reallocated to under loaded VMs. Here, the proposed LB algorithm adapts capacity and loads for the reallocation. Based on TPF and VPF, the tasks are reallocated from VMs using the proposed EHGWO. The proposed EHGWO is developed by integrating EHO and GWO algorithm using a new fitness function formulated by load of VM, migration cost, load of VM, capacity of VM and makespan. The proposed EHGWO is analyzed based on load and makespan.

scholarly journals Routing Protocol for Heterogeneous Wireless Sensor Networks Based on a Modified Grey Wolf Optimizer

Sensors ◽  
2020 ◽  
Vol 20 (3) ◽  
pp. 820 ◽  
Author(s):  
Xiaoqiang Zhao ◽  
Shaoya Ren ◽  
Heng Quan ◽  
Qiang Gao
Keyword(s):  
Routing Protocol ◽  
Clustering Algorithm ◽  
Wireless Sensor ◽  
Grey Wolf Optimizer ◽  
Grey Wolf ◽  
Fitness Value ◽  
Heterogeneous Wireless Sensor Networks ◽  
Limited Power ◽  
Energy Efficient Clustering ◽  
Node Energy

Wireless sensor network (WSN) nodes are devices with limited power, and rational utilization of node energy and prolonging the network lifetime are the main objectives of the WSN’s routing protocol. However, irrational considerations of heterogeneity of node energy will lead to an energy imbalance between nodes in heterogeneous WSNs (HWSNs). Therefore, in this paper, a routing protocol for HWSNs based on the modified grey wolf optimizer (HMGWO) is proposed. First, the protocol selects the appropriate initial clusters by defining different fitness functions for heterogeneous energy nodes; the nodes’ fitness values are then calculated and treated as initial weights in the GWO. At the same time, the weights are dynamically updated according to the distance between the wolves and their prey and coefficient vectors to improve the GWO’s optimization ability and ensure the selection of the optimal cluster heads (CHs). The experimental results indicate that the network lifecycle of the HMGWO protocol improves by 55.7%, 31.9%, 46.3%, and 27.0%, respectively, compared with the stable election protocol (SEP), distributed energy-efficient clustering algorithm (DEEC), modified SEP (M-SEP), and fitness-value-based improved GWO (FIGWO) protocols. In terms of the power consumption and network throughput, the HMGWO is also superior to other protocols.

ADOFL: Multi-Kernel-Based Adaptive Directive Operative Fractional Lion Optimisation Algorithm for Data Clustering

2018 ◽  
Vol 27 (3) ◽  
pp. 317-329 ◽  
Author(s):  
Satish Chander ◽  
P. Vijaya ◽  
Praveen Dhyani
Keyword(s):  
Data Clustering ◽  
Clustering Algorithm ◽  
Fitness Function ◽  
Clustering Algorithms ◽  
Previous Method ◽  
Optimisation Algorithm ◽  
Lion Algorithm ◽  
Similar Cluster ◽  
Centroid Point ◽  
Data Objects

Abstract The progress of databases in fields such as medical, business, education, marketing, etc., is colossal because of the developments in information technology. Knowledge discovery from such concealed bulk databases is a tedious task. For this, data mining is one of the promising solutions and clustering is one of its applications. The clustering process groups the data objects related to each other in a similar cluster and diverse objects in another cluster. The literature presents many clustering algorithms for data clustering. Optimisation-based clustering algorithm is one of the recently developed algorithms for the clustering process to discover the optimal cluster based on the objective function. In our previous method, direct operative fractional lion optimisation algorithm was proposed for data clustering. In this paper, we designed a new clustering algorithm called adaptive decisive operative fractional lion (ADOFL) optimisation algorithm based on multi-kernel function. Moreover, a new fitness function called multi-kernel WL index is proposed for the selection of the best centroid point for clustering. The experimentation of the proposed ADOFL algorithm is carried out over two benchmarked datasets, Iris and Wine. The performance of the proposed ADOFL algorithm is validated over existing clustering algorithms such as particle swarm clustering (PSC) algorithm, modified PSC algorithm, lion algorithm, fractional lion algorithm, and DOFL. The result shows that the maximum clustering accuracy of 79.51 is obtained by the proposed method in data clustering.

scholarly journals Approximate Multi-Degree Reduction of SG-Bézier Curves Using the Grey Wolf Optimizer Algorithm

Symmetry ◽  
2019 ◽  
Vol 11 (10) ◽  
pp. 1242
Author(s):  
Hu ◽  
Qiao ◽  
Qin ◽  
Wei
Keyword(s):  
Computer Aided Design ◽  
Fitness Function ◽  
Grey Wolf Optimizer ◽  
Grey Wolf ◽  
Degree Reduction ◽  
Bezier Curves ◽  
Bézier Curves ◽  
Geometric Properties ◽  
Reduction Effect ◽  
Aided Design

SG-Bézier curves have become a useful tool for shape design and geometric representation in computer aided design (CAD), owed to their good geometric properties, e.g., symmetry and convex hull property. Aiming at the problem of approximate degree reduction of SG-Bézier curves, a method is proposed to reduce the n-th SG-Bézier curves to m-th (m < n) SG-Bézier curves. Starting from the idea of grey wolf optimizer (GWO) and combining the geometric properties of SG-Bézier curves, this method converts the problem of multi-degree reduction of SG-Bézier curves into solving an optimization problem. By choosing the fitness function, the approximate multi-degree reduction of SG-Bézier curves with adjustable shape parameters is realized under unrestricted and corner interpolation constraints. At the same time, some concrete examples of degree reduction and its errors are given. The results show that this method not only achieves good degree reduction effect, but is also easy to implement and has high accuracy.

Sign in / Sign up

Export Citation Format

Share Document