首页> 外文会议>International Joint Conference on Neural Networks >Optimizing Radial Basis Probabilistic Neural Networks Using Recursive Orthogonal Least Squares Algorithms Combined with Micro-Genetic Algorithms
【24h】

Optimizing Radial Basis Probabilistic Neural Networks Using Recursive Orthogonal Least Squares Algorithms Combined with Micro-Genetic Algorithms

机译:优化使用递归正交最小二乘算法与微遗传算法相结合的径向基概率神经网络

获取原文

摘要

The paper focuses on discussing how to train and optimize the radial basis probabilistic neural network, (RBPNN) structure by Recursive Orthogonal Least Squares Algorithms (ROLSA) combined with Micro-Genetic Algorithms (/y-GA). First, the previous ROLSA, used for optimally selecting the hidden centers of the RBPNN, was improved in two aspects, i.e., adopting new double error criterions and new stop condition. Secondly, the micro-genetic algorithm, used for optimizing the controlling parameter of kernel function, was incorporated in the improved ROLSA in order that the structure of RBPNN can be entirely optimized. Finally, to demonstrate the power of our approach, two examples, i.e., both two spirals classification problem and IRIS classification problem, were employed to validate the performance of the classification. The experimental result showed that, for the two spirals problem the structure of the RBPNN with 200 initial hidden centers was considerably compressed into the one with 30 hidden centers, and for the IRIS classification problem only 9 hidden centers among 75 initial hidden centers were selected for the optimized RBPNN structure. Whereas for the Radial Basis Function Neural Network (RBFNN), under the same condition, for the two spirals problem, there were still 46 hidden centers left, and for the IRIS problem 15 hidden centers were selected into the optimal structure of the RBFNN. Moreover, the experimental results also illustrated that the generalization performance of the optimized RBPNN for the two examples was obviously better than the one of the optimized RBFNN.
机译:本文的重点讨论如何训练和优化径向基概率神经网络,通过递推正交(RBPNN)结构微遗传算法的组合的最小二乘算法(ROLSA)(/ Y-GA)。首先,用于最佳地选择RBPNN的隐藏中心的先前ROLSA在两个方面,即采用新的双重错误标准和新的停止条件。其次,用于优化核函数控制参数的微遗传算法在改进的ROLSA中结合在于,可以完全优化RBPNN的结构。最后,为了展示我们的方法的力量,采用了两个示例,即两个螺旋分类问题和虹膜分类问题,以验证分类的性能。实验结果表明,对于两个螺旋问题,具有200名初始隐藏中心的RBPNN的结构被大幅压缩成30个隐藏中心,对于虹膜分类问题,只选择了75个初始隐藏中心中的9个隐藏中心。优化的RBPNN结构。虽然对于径向基函数神经网络(RBFNN),在相同的条件下,对于两个螺旋问题,仍然存在46个隐藏的中心,并且对于虹膜问题,将隐藏的中心选择入RBFNN的最佳结构。此外,实验结果还示出了两种实施例的优化RBPNN的泛化性能明显优于优化的RBFNN之一。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号