考虑了在一般情况下各种可能的算法模型，分析了这些不同算法的参数选择问题、以及收敛速度问题。
All the possible algorithm models in general conditions have been considered, and parameter choice and convergence speed of these different algorithm were investigated.
分析了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.
并在仿真测试中对该模型的性能进行了分析，证明该模型在收敛时间，节点查询速度，和对扰动的适应性方面优于传统的模型。
The simulation results of the model performance are analyzed to prove the convergence time, node querying speed and adaptability to churn are better than the traditional model.
应用推荐