2023
DOI: 10.1080/08839514.2023.2166232
|View full text |Cite
|
Sign up to set email alerts
|

An Enhanced GWO Algorithm with Improved Explorative Search Capability for Global Optimization and Data Clustering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(5 citation statements)
references
References 100 publications
0
1
0
Order By: Relevance
“…In 2023, Shial et al [10] proposed that the exponential decay equation helps in transforming the exploration to exploitation process from initial iterations to final iterations, with proportions of 70% and 30% respectively, enhancing the exploration capability significantly.…”
Section: Parameter Improvementmentioning
confidence: 99%
“…In 2023, Shial et al [10] proposed that the exponential decay equation helps in transforming the exploration to exploitation process from initial iterations to final iterations, with proportions of 70% and 30% respectively, enhancing the exploration capability significantly.…”
Section: Parameter Improvementmentioning
confidence: 99%
“…Particularly in experimental research, they are utilized to observe and compare the performance of different algorithms. Among these, the Wilcoxon signed-rank test has gained favor due to its simplicity in computation and reliability in results [36,37]. To further assess INGO's performance, a Wilcoxon signed-rank test was conducted on the optimal results of the INGO and four other algorithms over 30 independent runs at a significance level of p = 5%, determining whether INGO significantly differed from other intelligent optimization algorithms.…”
Section: Algorithmmentioning
confidence: 99%
“…where n denotes the number of observations, K -the number of cluster centers, and i -the number of iterations to complete. Additionally, meta-heuristic-based partitional clustering algorithms handle such local convergence issues by using their stochastic operators, that ensures to adapt the global searches [7,13,48] for achieving near-optimal solutions. The traditional partitioning algorithms rely on some strict rules or mathematical logic for achieving optimal solutions, whereas meta-heuristic algorithms approach towards the optimal solutions by maintaining cooperation among population members with a few randomness [58].…”
Section: Partitional Clusteringmentioning
confidence: 99%
“…The recent literature reports that most of the meta-heuristic-based optimization algorithms are able to solve real-life optimization problems and those algorithms are such as: grey wolf optimization (GWO) [34], teaching learning-based optimization (TLBO) [44], bacteria foraging optimization (BFO) [17], the whale optimization algorithm (WOA) [33], the JAYA algorithm [43], ant colony optimization (ACO) [10], the sine cosine algorithm (SCA) [32], simulated annealing (SA) [29], the spotted hyena optimization algorithm (SHOA) [9], ant lion optimization (ALO) [31], particle swarm optimizations (PSO) [28], chemical reaction optimization (CRO) [30], differential evolution (DE) [50], etc. In recent times, most researchers have received immense interest in applying such nature-inspired algorithms on clustering problems [46][47][48][49]. Similarly, Jafer and Sivakumar [25] published a review article on a nature-inspired-based meta-heuristic optimization algorithm on ant-based clustering.…”
Section: Introductionmentioning
confidence: 99%