...
首页> 外文期刊>International Journal of Neural Systems >A hierarchical method for finding optimal architecture and weights using evolutionary least square based learning
【24h】

A hierarchical method for finding optimal architecture and weights using evolutionary least square based learning

机译:使用基于进化最小二乘的学习找到最佳架构和权重的分层方法

获取原文
获取原文并翻译 | 示例
           

摘要

In this paper, we present a novel approach of implementing a combination methodology to find appropriate neural network architecture and weights using an evolutionary least square based algorithm (GALS).1 This paper focuses on aspects such as the heuristics of updating weights using an evolutionary least square based algorithm, finding the number of hidden neurons for a two layer feed forward neural network, the stopping criterion for the algorithm and finally some comparisons of the results with other existing methods for searching optimal or near optimal solution in the multidimensional complex search space comprising the architecture and the weight variables. We explain how the weight updating algorithm using evolutionary least square based approach can be combined with the growing architecture model to find the optimum number of hidden neurons. We also discuss the issues of finding a probabilistic solution space as a starting point for the least square method and address the problems involving fitness breaking. We apply the proposed approach to XOR problem, 10 bit odd parity problem and many real-world benchmark data sets such as handwriting data set from CEDAR, breast cancer and heart disease data sets from UCI ML repository. The comparative results based on classification accuracy and the time complexity are discussed.
机译:在本文中,我们提出了一种新颖的方法,该方法使用一种基于进化最小二乘的算法(GALS)来实现一种组合方法,以找到合适的神经网络体系结构和权重。1本文着眼于诸如使用进化最小二乘更新权重的启发法等方面基于平方的算法,找到两层前馈神经网络的隐藏神经元数量,该算法的停止准则,最后将结果与其他现有方法进行多维复杂搜索空间中搜索最优或接近最优解的比较架构和权重变量。我们解释了如何使用基于进化最小二乘法的权重更新算法与增长的体系结构模型相结合,以找到隐藏神经元的最佳数量。我们还将讨论寻找概率解空间作为最小二乘法的起点的问题,并解决涉及适应度破坏的问题。我们将提出的方法应用于XOR问题,10位奇偶校验问题以及许多现实世界的基准数据集,例如CEDAR的手写数据集,乳腺癌和UCI ML存储库的心脏病数据集。讨论了基于分类精度和时间复杂度的比较结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号