首页 | 本学科首页   官方微博 | 高级检索  
     检索      

遗传算法优化工业对象的RBF神经网络模型
引用本文:金蓉,曹柳林.遗传算法优化工业对象的RBF神经网络模型[J].北京化工大学学报(自然科学版),2000,27(3):67-70.
作者姓名:金蓉  曹柳林
作者单位:北京化工大学自动化系, 北京 100029
摘    要:针对石油化学工业中的某一典型对象的建模过程,介绍一种以可变长度的自然数编码、以AIC(Akaike’sinformationcriterion)为优化目标的遗传算法(GA)设计径向基函数(RBF)神经网络隐含层结构。文中阐述了该方法的原理,实现步骤及网络泛化性能检验,并与正交最小二乘 (OLS)算法相比较,发现前者设计的网络结构相对简单且网络泛化能力有所改善。

关 键 词:RBF神经网络  遗传算法  正交最小二乘算法  AIC  RBF神经网络    遗传算法    正交最小二乘算法    AIC
收稿时间:1999-09-07

Optimizing the RBF neural network model for an industrial objective by the genetic algorithms
JIN Rong,CAO Liu-lin.Optimizing the RBF neural network model for an industrial objective by the genetic algorithms[J].Journal of Beijing University of Chemical Technology,2000,27(3):67-70.
Authors:JIN Rong  CAO Liu-lin
Institution:Department of Chemical Automation, Beijing University of Chemical Techology, Beijing 100029, China
Abstract:Aimed at the modeling of a typical object in the petrochemical industry, the genetic algorithms,is introduced to design the architecture of RBF neural network, in which the technique of variable length encoding with natural numbers is involved and Akaike's information criterion is chosen as the optimal objective. The fundamentals,concrete procedures of GA and generalization performance tests are presented. The RBF neural network derived by GA has relatively simple configuration and improved generalization performance compared with that derive by the orthogonal least square leaming algorithm.
Keywords:radial basis function neural network  genetic algorithm  orthogonal least square learning  algorithm  Akaike's information criterion
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《北京化工大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《北京化工大学学报(自然科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号