2009
DOI: 10.1016/j.neunet.2009.05.013
|View full text |Cite
|
Sign up to set email alerts
|

Evolutionary artificial neural networks by multi-dimensional particle swarm optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
109
0
1

Year Published

2010
2010
2023
2023

Publication Types

Select...
8
1

Relationship

3
6

Authors

Journals

citations
Cited by 236 publications
(111 citation statements)
references
References 39 publications
(63 reference statements)
1
109
0
1
Order By: Relevance
“…Particularly, we can foresee that those problems where a proper guidance mechanism such as FGBF is needed but cannot be applied due to infeasibility problems (e.g. evolutionary ANN applications by the standalone MD-PSO as in [18] and [23]), SAD MD-PSO would be a promising solution to further improve the performance. For those multi-objective problems (MOPs), the application of SAD PSO can be crucial since the goal is to search for a set of Pareto-optimal solutions and hence, the particles must follow (a set of) best guide(s) that will lead them toward the optimal solutions.…”
Section: Discussionmentioning
confidence: 99%
“…Particularly, we can foresee that those problems where a proper guidance mechanism such as FGBF is needed but cannot be applied due to infeasibility problems (e.g. evolutionary ANN applications by the standalone MD-PSO as in [18] and [23]), SAD MD-PSO would be a promising solution to further improve the performance. For those multi-objective problems (MOPs), the application of SAD PSO can be crucial since the goal is to search for a set of Pareto-optimal solutions and hence, the particles must follow (a set of) best guide(s) that will lead them toward the optimal solutions.…”
Section: Discussionmentioning
confidence: 99%
“…Similarly, in [210,211], a hybrid Taguchi-genetic algorithm was proposed for optimizing the FNN architecture and weights, where authors used a genetic representation of the weights, but they select structure using constructive method (by adding hidden nodes one-by-one). A multidimensional PSO approach was proposed in [212] for constructing FNN automatically by using an architectural (topological) space. Moreover, the individuals in the swarm population were designed in such a way that it optimized both position (weights) and dimension (architecture) of an individual in each iteration.…”
Section: Architecture Plus Weight Optimizationmentioning
confidence: 99%
“…Multi-dimensional PSO (MD PSO) [14] is natural extension of the conventional PSO method that allows the particles to make interdimensional jumps and visits any dimension within a given range, [ ]. Thus, the MD PSO searches for the global best solution among several search spaces with different dimensions.…”
Section: Multi-dimensional Particle Swarm Optimizationmentioning
confidence: 99%
“…Also, the computation time in PSO is usually less than in GAs, because all the particles in PSO tend to converge to the best solution rather quickly [16]. In this paper we adapt the multidimensional extension of the basic PSO algorithm (MD PSO, [14]) to optimize the output vector dimension of the synthesized audio features. This voids the need of fixing the dimension of the solution space (corresponding to the dimension of the synthesized vector) in advance.…”
Section: Introductionmentioning
confidence: 99%