2015
DOI: 10.1016/j.asoc.2015.03.035
|View full text |Cite
|
Sign up to set email alerts
|

Ions motion algorithm for solving optimization problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
103
0
1

Year Published

2015
2015
2021
2021

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 208 publications
(104 citation statements)
references
References 24 publications
0
103
0
1
Order By: Relevance
“…Because The reservoir connectivity and weight structure of ESN are created randomly beforehand, So the random connectivity and weight structure of the reservoir is unlikely to be optimal. In order to find an optimal reservoir given a task and to improve the performance of ESN, we will apply several recently proposed algorithms such as, Ions Motion Algorithm [73], Grey Wolf Optimizer [74], Ant Lion Optimizer [75] and Multi Verse Optimizer [76] to ESN in the future. …”
Section: Resultsmentioning
confidence: 99%
“…Because The reservoir connectivity and weight structure of ESN are created randomly beforehand, So the random connectivity and weight structure of the reservoir is unlikely to be optimal. In order to find an optimal reservoir given a task and to improve the performance of ESN, we will apply several recently proposed algorithms such as, Ions Motion Algorithm [73], Grey Wolf Optimizer [74], Ant Lion Optimizer [75] and Multi Verse Optimizer [76] to ESN in the future. …”
Section: Resultsmentioning
confidence: 99%
“…Magnetic Charged System Search (MCSS) [21] utilizes the governing laws for magnetic forces in addition to electrical forces for optimization. Ions Motion Optimization (IMO) [22] is proposed based on the attraction and repulsion of anions and cations to perform optimization.…”
Section: Introductionmentioning
confidence: 99%
“…Recently, many bioinspired heuristic algorithms have been designed to solve optimization problems and successfully applied in data classification problems [6][7][8]. Among them, ant colony optimization (ACO) algorithms have shown promising performance in mining classification rules in the form of "IF ⟨ 1 ⟩ AND ⟨ 2 ⟩ AND ⋅ ⋅ ⋅ ⟨ ⟩ THEN ⟨ ⟩."…”
Section: Introductionmentioning
confidence: 99%
“…ℎ AntMiner order is equipped with an orderly roulette selection strategy and a new pheromone update strategy to enhance the capability of handling largescale problems and the robustness. Particularly, in the orderly ← 0; (6) while t < maximum iterations and no stagnation do (7) for ← 1 to ants_size do (8) ← Create Rule(examples); (9) Prune( ); (10) Evaluate ; (11) -← ; (12) end for (13) Update Pheromones( roulette selection, the data attributes are sorted such that the algorithm can distinguish the pros and cons of each attribute and construct good classification model more efficiently. The new pheromone update strategy is designed to guide the ants to find better global optimal solutions, which strengthens the degree of pheromone update to avoid falling into local optimum.…”
Section: Introductionmentioning
confidence: 99%