.png){kind=icon}
.png){kind=icon}
Return
Dynamic Group Optimization Algorithm With Embedded Chaos
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2017.2724073.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Recently, a new algorithm named dynamic group optimization (DGO) has been proposed, which is developed to mimic the behaviors of animal and human group socializing. However, one of the major drawbacks of the DGO is the premature convergence. Therefore, in order to deal with this challenge, we introduce chaos theory into the DGO algorithm and come up with a new chaotic dynamic group optimization algorithm (CDGO) that can accelerate the convergence of DGO. Various chaotic maps are used to adjust the update of solutions in CDGO. Extensive experiments have been carried out, and the results have shown that CDGO can be a very promising tool for solving optimization algorithms. We also demonstrated good results based on real world data, where, in particular, solving multimedia data clustering problems.
Keywords:
Chaos
dynamic group optimization
convergence
heuristic algorithms
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W