DocumentCode :
2004016
Title :
Evolving neural networks using ant colony optimization with pheromone trail limits
Author :
Mavrovouniotis, Michalis ; Shengxiang Yang
Author_Institution :
Centre for Comput. Intell. (CCI), De Montfort Univ., Leicester, UK
fYear :
2013
fDate :
9-11 Sept. 2013
Firstpage :
16
Lastpage :
23
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.
Keywords :
ant colony optimisation; backpropagation; evolutionary computation; neural nets; ACO algorithms; BP technique; ant colony optimization; back-propagation technique; evolutionary algorithms; evolving neural networks; hybrid training; pheromone trail limits; stagnation behaviour avoidance; Artificial neural networks; Cancer; Diabetes; Heart; Optimization; Testing; Training;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Intelligence (UKCI), 2013 13th UK Workshop on
Conference_Location :
Guildford
Print_ISBN :
978-1-4799-1566-8
Type :
conf
DOI :
10.1109/UKCI.2013.6651282
Filename :
6651282
Link To Document :
بازگشت