首页> 美国卫生研究院文献>Heliyon >Training of feedforward neural networks for data classification using hybrid particle swarm optimization Mantegna Lévy flight and neighborhood search
【2h】

Training of feedforward neural networks for data classification using hybrid particle swarm optimization Mantegna Lévy flight and neighborhood search

机译:使用混合粒子群优化MantegnaLévy飞行和邻域搜索训练前馈神经网络进行数据分类

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Artificial Neural networks (ANNs) are often applied to data classification problems. However, training ANNs remains a challenging task due to the large and high dimensional nature of search space particularly in the process of fine-tuning the best set of control parameters in terms of weight and bias. Evolutionary algorithms are proved to be a reliable optimization method for training the parameters. While a number of conventional training algorithms have been proposed and applied to various applications, most of them share the common disadvantages of local optima stagnation and slow convergence. In this paper, we propose a new evolutionary training algorithm referred to as LPSONS, which combines the velocity operators in Particle Swarm Optimization (PSO) with Mantegna Lévy distribution to produce more diverse solutions by dividing the population and generation between different sections of the algorithm. It further combines Neighborhood Search with Mantegna Lévy distribution to mitigate premature convergence and avoid local minima. The proposed algorithm can find optimal results and at the same time avoid stagnation in local optimum solutions as well as prevent premature convergence in training Feedforward Multi-Layer Perceptron (MLP) ANNs. Experiments with fourteen standard datasets from UCI machine learning repository confirm that the LPSONS algorithm significantly outperforms a gradient-based approach as well as some well-known evolutionary algorithms that are also based on enhancing PSO.
机译:人工神经网络(ANN)通常用于数据分类问题。然而,由于搜索空间的高和高维度性质,训练ANN仍然是一项艰巨的任务,特别是在根据权重和偏差微调最佳控制参数集的过程中。进化算法被证明是训练参数的可靠的优化方法。虽然已经提出了许多常规训练算法并将其应用于各种应用,但是它们中的大多数共享局部最优停滞和慢收敛的共同缺点。在本文中,我们提出了一种称为LPSONS的新的进化训练算法,该算法将粒子群优化(PSO)中的速度算子与MantegnaLévy分布相结合,以通过在算法的不同部分之间划分总体和生成来产生更多样化的解决方案。它将邻里搜索与MantegnaLévy分布进一步结合,以减轻过早的收敛并避免局部最小值。该算法不仅可以找到最优结果,而且可以避免局部最优解的停滞,并可以防止训练前馈多层感知器(MLP)ANN的过早收敛。来自UCI机器学习存储库的14个标准数据集的实验证实,LPSONS算法明显优于基于梯度的方法以及一些也基于增强PSO的著名进化算法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号