Hybrid multiobjective evolutionary design for artificial neural networks

被引:63
作者
Goh, Chi-Keong [1 ]
Teoh, Eu-Jin [2 ]
Tan, Kay Chen [2 ]
机构
[1] Data Storage Inst, Agcy Sci Technol & Res, Singapore 117608, Singapore
[2] Natl Univ Singapore, Dept Elect & Comp Engn, Singapore 119260, Singapore
来源
IEEE TRANSACTIONS ON NEURAL NETWORKS | 2008年 / 19卷 / 09期
关键词
artificial neural network (ANN); evolutionary algorithms; local search; multiobjective optimization; singular value decomposition (SVD);
D O I
10.1109/TNN.2008.2000444
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Evolutionary algorithms are a class of stochastic search methods that attempts to emulate the biological process of evolution, incorporating concepts of selection, reproduction, and mutation. In recent years, there has been an increase in the use of evolutionary approaches in the training of artificial neural networks (ANNs). While evolutionary techniques for neural networks have shown to provide superior performance over conventional training approaches, the simultaneous optimization of network performance and architecture will almost always result in a slow training process due to the added algorithmic complexity. In this paper, we present a geometrical measure based on the singular value decomposition (SVD) to estimate the necessary number of neurons to be used in training a single-hidden-layer feedforward neural network (SLFN). In addition, we develop a new hybrid multiobjective evolutionary approach that includes the features of a variable length representation that allow for easy adaptation of neural networks structures, an architectural recombination procedure based on the geometrical measure that adapts the number of necessary hidden neurons and facilitates the exchange of neuronal information between candidate designs, and a microhybrid genetic algorithm (mu HGA) with an adaptive local search intensity scheme for local fine-tuning. In addition, the performances of well-known algorithms as well as the effectiveness and contributions of the proposed approach are analyzed and validated through a variety of data set types.
引用
收藏
页码:1531 / 1548
页数:18
相关论文
共 65 条
[1]  
Abbass H. A., 2001, LECT NOTES ARTIF INT, V2256, P1
[2]   Speeding up backpropagation using multiobjective evolutionary algorithms [J].
Abbass, HA .
NEURAL COMPUTATION, 2003, 15 (11) :2705-2726
[3]  
[Anonymous], 2001, SPEA2 IMPROVING STRE
[4]  
Antonie ML, 2006, IEEE DATA MINING, P33
[5]   Systematic integration of parameterized local search into evolutionary algorithms [J].
Bambha, NK ;
Bhattacharyya, SS ;
Teich, J ;
Zitzler, E .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2004, 8 (02) :137-155
[6]   The sample complexity of pattern classification with neural networks: The size of the weights is more important than the size of the network [J].
Bartlett, PL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (02) :525-536
[7]   An empirical comparison of combinations of evolutionary algorithms and neural networks for classification problems [J].
Cantú-Paz, E ;
Kamath, C .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2005, 35 (05) :915-927
[8]   Organotin levels in the Ria Formosa lagoon, Portugal [J].
Coelho, MR ;
Bebianno, MJ ;
Langston, WJ .
APPLIED ORGANOMETALLIC CHEMISTRY, 2002, 16 (07) :384-390
[9]  
Coello Coello C. A., 1999, INT J, V1, P269, DOI DOI 10.1007/BF03325101
[10]   GEOMETRICAL AND STATISTICAL PROPERTIES OF SYSTEMS OF LINEAR INEQUALITIES WITH APPLICATIONS IN PATTERN RECOGNITION [J].
COVER, TM .
IEEE TRANSACTIONS ON ELECTRONIC COMPUTERS, 1965, EC14 (03) :326-&