2016 International Symposium on INnovations in Intelligent SysTems and Applications (INISTA) 2016
DOI: 10.1109/inista.2016.7571839
|View full text |Cite
|
Sign up to set email alerts
|

A hybrid dragonfly algorithm with extreme learning machine for prediction

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
13
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 30 publications
(13 citation statements)
references
References 16 publications
0
13
0
Order By: Relevance
“…In [29], DA was combined with an extreme learning machine (ELM) to overcome the problems in gradient-based algorithms. In this technique to optimally select the biases of the hidden layer, DA was used.…”
Section: Hybridization Versions Of Damentioning
confidence: 99%
“…In [29], DA was combined with an extreme learning machine (ELM) to overcome the problems in gradient-based algorithms. In this technique to optimally select the biases of the hidden layer, DA was used.…”
Section: Hybridization Versions Of Damentioning
confidence: 99%
“…Dragonflies are luxurious insects. There are nearly 3000 different species of these insects worldwide [28] [30] [31] [32]. The main inspiration of the DA algorithm comes from clustered behavior in static and dynamic manners.…”
Section: Dragonfly Algorithmmentioning
confidence: 99%
“…[25][26][27] To avoid static collision with "N" number of neighbors, separation can be calculated as in Equation (17) with X and X j being the current and jth position of the fly respectively: They exhibit two phases of movements such as static or exploration phase and dynamic or exploitation phase in which the flies form groups for hunting their prey and migrates over long distance, respectively.…”
Section: Dragonfly Algorithmmentioning
confidence: 99%
“…The fundamental behaviors of DA are separation, alignment, cohesion, and distraction. [25][26][27] To avoid static collision with "N" number of neighbors, separation can be calculated as in Equation (17) with X and X j being the current and jth position of the fly respectively:…”
Section: Dragonfly Algorithmmentioning
confidence: 99%