The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2019
DOI: 10.1007/s00521-019-04174-0
|View full text |Cite
|
Sign up to set email alerts
|

Opposition-based antlion optimizer using Cauchy distribution and its application to data clustering problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 18 publications
(4 citation statements)
references
References 54 publications
0
4
0
Order By: Relevance
“…Kilic et al [34] replaced the roulette selection method with the tournament strategy and reduced the scale of the random walk of the ant population, which contributes to improving the accuracy and speed of the algorithm. Guo et al proposed an improved antlion optimizer (OB-C-ALO) [35] and used it to solve the data clustering problem. The optimizer uses a random walk based on the Cauchy distribution rather than a uniform distribution to escape from local optimal solutions the local optimal value, and then combines the learning model based on the opposition with the acceleration coefficient, which overcomes the shortcomings of the slow convergence of the original ALO.…”
Section: Related Workmentioning
confidence: 99%
“…Kilic et al [34] replaced the roulette selection method with the tournament strategy and reduced the scale of the random walk of the ant population, which contributes to improving the accuracy and speed of the algorithm. Guo et al proposed an improved antlion optimizer (OB-C-ALO) [35] and used it to solve the data clustering problem. The optimizer uses a random walk based on the Cauchy distribution rather than a uniform distribution to escape from local optimal solutions the local optimal value, and then combines the learning model based on the opposition with the acceleration coefficient, which overcomes the shortcomings of the slow convergence of the original ALO.…”
Section: Related Workmentioning
confidence: 99%
“…The ATD, which can adaptively adjust the speed factor and filter factor according to the change rate of the input signal, is designed in this paper, to manage the contradiction between filtering performance and tracking speed. Moreover, the LADRC introducing the proposed ATD will consume less energy than the LADRC [34], eliminating the peak value of the control signal and reducing the impact of the control effect on the final controlling element.…”
Section: Proposed Adaptive Tracking Differentiator Designmentioning
confidence: 99%
“…Also in [133], [134], the same authors introduced 2 new variant of ALO called OB-ac-ALO, and OB-C-ALO. The first algorithm is based on OBL and acceleration coefficient(ac), while the second use OBL besides Cauchy distribution.…”
Section: ) Lévy Alo and Opposition-based Alomentioning
confidence: 99%