节点文献

人工神经网络在数据挖掘中的应用研究

The Research of Artificial Neural Networks in Date Mining

【作者】 崔丽群

【导师】 刘万军;

【作者基本信息】 辽宁工程技术大学 , 计算机应用技术, 2004, 硕士

【摘要】 神经网络在数据挖掘的应用中主要存在两个问题,一是训练时间过长;二是获得的知识难以理解和表示。神经网络中的规则提取方法是解决“黑箱问题” 的有效手段,论文分析了基于结构分解和基于输入输出映射的神经网络规则提取的基本思想和对应的各种算法,并对它们的性能进行比较。BP算法是多层前向神经网络中应用最为广泛的一种算法,但是由于BP算法实质上是一种基于梯度下降的搜索算法,因此它存在着算法效率较低、收敛速度慢、易于陷入局部极小值等现状;对于较大的搜索空间、多峰值和不可微函数常常不能搜索到全局极小点,这些制约了BP网络在各个领域中的应用,本文从BP网络的工作原理出发,分析产生局部极小的原因,提出了对BP网络全局优化的改进策略。全局优化改进策略从基于网络模型的优化和基于网络算法的优化两个方面考虑。基于网络模型的优化重点对结构参数中的初始权值的选取、学习系数、神经元的激励函数及误差函数提出改进方法;基于网络算法的改进主要包括基于标准数值优化的改进方法和基于标准梯度下降的改进方法。通过对BP改进模型的比较的研究及实验证明:改进的BP算法缩短了学习时间、提高了学习效率,不仅满足了误差目标的要求,而且提高了网络的泛化能力,在一定程度上避免了学习中的局部极小问题,实现了全局优化。

【Abstract】 The two problems of data mining using neural networks are the long training time and being understood and explicit representation of the acquired knowledge. The rule extraction of neural networks is discussed, which is an effective method to avoid shortcoming of being “black boxes”. Techniques based on decompositional and input-output mapping approaches are studied, their fundamental concepts and pedagogical rule extraction are compared in detail.The BP algorithm is kind of algorithm which is in use widely in multilayer neural network, because the BP algorithm is a kind of gradient descended searching algorithm in essence, it has weaknesses such as inefficient, slow convergent speed and easy getting into local minimum, insurable to find global extreme value point for multi-modal and non-differential function in larger searching zone, which restrict neural network’s application in all fields. So from the principle, analysis the reasons of BP algorithm to be dropped in local minimization and propose a global optima strategy.The global optima strategy is discussed from two aspects, one of improved strategy based on model, and another based on algorithm. A comparative study on some typical improved models of BP networks, which based on Gradient descent and numerical optimization are proposed. Experiments results show that the modified BP arithmetic not only has shorted study time, high efficiency, but also meet with the error goal, improve the generalization capability. So it can averted from getting into local minimum in some degree and achieve global optimization.

  • 【分类号】TP311.13;TP183
  • 【被引频次】11
  • 【下载频次】502
节点文献中: