2014
DOI: 10.1007/s00500-014-1334-5
|View full text |Cite
|
Sign up to set email alerts
|

Training neural networks with ant colony optimization algorithms for pattern classification

Abstract: Feed-forward neural networks are commonly used for pattern classification. The classification accuracy of feed-forward neural networks depends on the configuration selected and the training process. Once the architecture of the network is decided, training algorithms, usually gradient descent techniques, are used to determine the connection weights of the feed-forward neural network. However, gradient descent techniques often get trapped in local optima of the search landscape. To address this issue, an ant co… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
33
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 94 publications
(33 citation statements)
references
References 38 publications
0
33
0
Order By: Relevance
“…For general transfer functions h(x f ), (17) is a non-convex and non-linear optimization problem that is commonly solved using stochastic gradient decent, ant-colony optimization, and simulated anealling methods [37], [38], [39].…”
Section: Classic Extreme Learning Machinementioning
confidence: 99%
“…For general transfer functions h(x f ), (17) is a non-convex and non-linear optimization problem that is commonly solved using stochastic gradient decent, ant-colony optimization, and simulated anealling methods [37], [38], [39].…”
Section: Classic Extreme Learning Machinementioning
confidence: 99%
“…The method has been created biologically from real ant behavior in food-seeking pattern. In other words, this bionic algorithm has been deployed for finding the optimal path [44]. The process is that when ants start to seek food they deposit a chemical material on the ground, which is known as pheromone while they are moving toward food source.…”
Section: Ant Colony Optimization (Aco)mentioning
confidence: 99%
“…In [57,82], the authors introduced an Ant Colony Optimization algorithm (ACO) to solve the continuous optimization. The work was applied to learning of MLP networks, and evaluated using different data classification problems.…”
Section: Related Workmentioning
confidence: 99%
“…Meta-heuristic learning has the ability to estimate optimal or semi-optimal connection weights set for ANNs with less probability to be trapped into the many local optima in the search space [4,35,80]. Many meta-heuristic learning algorithms have been used to train ANNs such as Genetic Algorithm (GA) [66,76], Particle Swarm Optimization (PSO) [101], Evolutionary Strategies (ES) [90], Ant Colony Optimization (ACO) [57], Cuckoo Search (CS) [68,86], Krill Herd Optimization (KH) [25,48], Firefly Algorithm (FA) [19], Population-Based Incremental Learning (PBIL) [30], Differential Evolution (DE) [42,88], Artificial Bee Colony (ABC) [45], and many others.…”
Section: Introductionmentioning
confidence: 99%