Then some defects such as slow convergence rate and getting into local minimum in BP algorithm are pointed out, and the root of the defects is presented.
分析了BP算法的基本原理，指出了BP算法具有收敛速度慢、易陷入局部极小点等缺陷以及这些缺陷产生的根源。
Then some defects such as slow convergence rate and getting into local minimum in BP algorithm are pointed out, and the root of the defects is presented.
针对前向神经网络BP算法由于初始权值选择不当而陷入局部极小点这一缺陷，提出新的全局优化训练算法。
Aiming at the slow convergence rate of BP neural network, append a correlative node on hidden layer, improve the adaptive ability and rate of studying of neural network.
针对BP算法收敛速度慢的特点，在隐含层上加入了关联节点，改善了网络的学习速率和适应能力。
In order to overcome the slow convergence rate of traditional CMA (Constant modulus algorithm), a Momentum algorithm based Constant modulus algorithm (MCMA) is proposed.
针对传统常数模算法收敛速度慢的缺点，提出了一种基于动量算法的常数模算法。
An improved neural network based on L-M algorithm has been applied to fault diagnosis expert system against to the slow convergence rate of conventional BP neural network.
针对传统BP神经网络训练中收敛速度较慢的缺点，提出一种基于L - M算法的神经网络应用于机械设备故障诊断的专家系统。
The BP neural network has the ability to solve many practical problems because of its strong mapping. However, it has slow convergence rate and is prone to fall into local extremum.
BP神经网络具有很强的映射能力，可以解决许多实际问题，但同时还存在着收敛速度慢，易陷于局部极小的缺点。
It is confirmed that PSO could overcome intrinsic shortcomings of BP neural network, including low learning efficiency, slow convergence rate, being easy to fall into local minima, etc.
经验证(PSO)优化算法可以有效地克服BP神经网络存在的学习效率低，收敛速度慢以及容易陷入局部极小点等固有缺点。
But if single neuron PID controller designed in terms of BPNN Theory is adopted, the control effect is not satisfactory because the learning rate and speed of convergence are slow.
使用常规pid控制很难满足手指精确位置控制的要求，而采用依据BPNN原理设计成的常规单神经元pid控制器又因学习速率低，收敛速度慢，控制效果不能令人满意。
The algorithm can get global minimum easily with a wide variety of functions of hidden neurons, and no problems such as local minima and slow rate of convergence are suffered like BP algorithm.
新算法选择很广一类的隐层神经元函数，可以直接求得全局最小点，不存在BP算法的局部极小、收敛速度慢等问题。
The algorithm can get global minimum easily with a wide variety of functions of hidden neurons, and no problems such as local minima and slow rate of convergence are suffered like BP algorithm.
新算法选择很广一类的隐层神经元函数，可以直接求得全局最小点，不存在BP算法的局部极小、收敛速度慢等问题。
应用推荐