Study on Improved Flexible Neural Tree Optimization Algorithm

Article Preview

Abstract:

The BP neural network is easy to fall into local minimum point, the algorithm convergence speed slow, this paper puts forward an improved algorithm of flexible neural tree, introduced the basic theory knowledge of Flexible neural tree , analyzes the characteristics and advantages of the neural tree. The structure optimization and parameter optimization are adopted some optimization algorithm, Introduced the multi expression programming algorithm for optimization of flexible neural tree structure and by using the improved particle swarm algorithm to optimize the parameters of flexible neural tree, Finally the establishment of complete flexible neural tree model.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 765-767)

Pages:

1055-1059

Citation:

Online since:

September 2013

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Zhao Junwei, Jia Guangfeng, Hou Qingtao, Chen Yuehui. analog circuit fault diagnosis methods Based on the flexible immune neural tree , Journal of shandong science, 2009, 22 (1): 35 to 39.

Google Scholar

[2] Wu Peng, Liu Zhen, Chen Yuehui. Time series forecasting based on neural tree , Shandong science, 2007, 20 ( 1): 59-64.

Google Scholar

[3] Oltean M, Dumitrescu D. Multi expression programming,. Cluj-Napoca: Babes-Bolyai University, (2002).

Google Scholar

[4] Oltean M, Grosan C. Evolving evolutionary algorithms using multi expression programming, Banzhaf W. The 7th European Conference on Artificial Life. Berlin: Springer-Verlag, 2003: 651-658.

DOI: 10.1007/978-3-540-39432-7_70

Google Scholar

[5] Kennedy J, Eberhart R. Particle Swarm Optimization , IEEE on Networks, 1995. 1942-(1948).

Google Scholar

[6] Wang Cunrui, Duan Xiaodong, Liu Xiangdong. Improved basic particle swarm optimization algorithm, Computer Engineering, 2004, 30 ( 21): 35-37.

Google Scholar