Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14279/30860
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Mavrovouniotis, Michalis | - |
dc.contributor.author | Yang, Shengxiang | - |
dc.date.accessioned | 2023-11-27T10:56:54Z | - |
dc.date.available | 2023-11-27T10:56:54Z | - |
dc.date.issued | 2013-12-31 | - |
dc.identifier.citation | 2013 13th UK Workshop on Computational Intelligence, UKCI 2013, 9 - 11 September 2013 | en_US |
dc.identifier.isbn | 9781479915682 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.14279/30860 | - |
dc.description.abstract | The back-propagation (BP) technique is a widely used technique to train artificial neural networks (ANNs). However, BP often gets trapped in a local optimum. Hence, hybrid training was introduced, e.g., a global optimization algorithm with BP, to address this drawback. The key idea of hybrid training is to use global optimization algorithms to provide BP with good initial connection weights. In hybrid training, evolutionary algorithms are widely used, whereas ant colony optimization (ACO) algorithms are rarely used, as the global optimization algorithms. And so far, only the basic ACO algorithm has been used to evolve the connection weights of ANNs. In this paper, we hybridize one of the best performing variations of ACO with BP. The difference of the improved ACO variation from the basic ACO algorithm lies in that pheromone trail limits are imposed to avoid stagnation behaviour. The experimental results show that the proposed training method outperforms other peer training methods. © 2013 IEEE. | en_US |
dc.language.iso | en | en_US |
dc.rights | © IEEE | en_US |
dc.subject | Ant colony optimization | en_US |
dc.subject | Constrained optimization | en_US |
dc.subject | Global optimization | en_US |
dc.subject | Neural networks | en_US |
dc.subject | ACO algorithms | en_US |
dc.subject | Ant Colony Optimization algorithms | en_US |
dc.subject | Connection weights | en_US |
dc.subject | Evolving neural network | en_US |
dc.subject | Global optimization algorithm | en_US |
dc.subject | Hybrid training | en_US |
dc.subject | Pheromone trails | en_US |
dc.subject | Training methods | en_US |
dc.subject | Algorithms | en_US |
dc.title | Evolving neural networks using ant colony optimization with pheromone trail limits | en_US |
dc.type | Conference Papers | en_US |
dc.collaboration | De Montfort University | en_US |
dc.subject.category | Computer and Information Sciences | en_US |
dc.country | United Kingdom | en_US |
dc.subject.field | Natural Sciences | en_US |
dc.relation.conference | 2013 13th UK Workshop on Computational Intelligence, UKCI 2013 | en_US |
dc.identifier.doi | 10.1109/UKCI.2013.6651282 | en_US |
dc.identifier.scopus | 2-s2.0-84891074769 | en |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/84891074769 | en |
dc.contributor.orcid | #NODATA# | en |
dc.contributor.orcid | #NODATA# | en |
cut.common.academicyear | 2013-2014 | en_US |
item.openairecristype | http://purl.org/coar/resource_type/c_c94f | - |
item.openairetype | conferenceObject | - |
item.cerifentitytype | Publications | - |
item.grantfulltext | none | - |
item.languageiso639-1 | en | - |
item.fulltext | No Fulltext | - |
crisitem.author.orcid | 0000-0002-5281-4175 | - |
Appears in Collections: | Άρθρα/Articles |
CORE Recommender
SCOPUSTM
Citations
20
19
checked on Mar 14, 2024
Page view(s) 20
87
Last Week
0
0
Last month
2
2
checked on Nov 21, 2024
Google ScholarTM
Check
Altmetric
Items in KTISIS are protected by copyright, with all rights reserved, unless otherwise indicated.