计算机与现代化

• 算法设计与分析 • 上一篇    下一篇

GRNN与RBFNN的二元函数逼近性能对比研究

  

  1. 渤海大学工学院,辽宁锦州121013
  • 收稿日期:2014-01-02 出版日期:2014-04-17 发布日期:2014-04-23
  • 作者简介:作者简介: 丁硕(1979),男(蒙古族),天津人,渤海大学工学院讲师,研究方向:人工智能,神经网络; 常晓恒(1977),男,天津人,教授,研究方向:系统建模,控制系统稳定性。
  • 基金资助:
     
    基金项目:国家自然科学基金资助项目(61104071)

Comparative Study on Binary Function Approximation Performances of GRNN and RBFNN

  1. College of Engineering, Bohai University, Jinzhou 121013, China
  • Received:2014-01-02 Online:2014-04-17 Published:2014-04-23

摘要:  

摘要: 为了研究GRNN和RBFNN对于二元非线性函数的逼近能力,本文编程建立GRNN和RBFNN,并以具体的二元非线性函数为例,分别用2种神经网络对其进行逼近。仿真结果表明,相对于RBFNN而言,GRNN对于二元非线性函数的逼近精度更高、收敛速度更快,具有很好的逼近能力,为解决二元非线性函数的逼近问题提供了良好的解决手段。

关键词: 广义回归神经网络, 径向基函数神经网络, 二元函数, 逼近, 仿真

Abstract:  

Abstract:  In order to compare the approximation performances of GRNN and RBFNN to binary functions, GRNN and RBFNN are first established through computer programming in this paper. A specific binary function is taken as an example to be approximated using the above two neural networks respectively. The simulation results show that in approximation to a binary function, compared with RBFNN, GRNN has higher precision, faster convergence speed, and better approximation ability. Thus it provides a good method to solve the problem of binary nonlinear function approximation.

Key words:

中图分类号: