|
摘要 |
4-5 |
|
1.基于数值计算方法的BP神经网络及遗传算法的优化研究 |
5-55 |
|
第一章 前言 |
7-8 |
|
1.1 研究背景 |
7 |
|
1.2 本文研究的内容 |
7-8 |
|
第二章 神经网络研究和改进 |
8-28 |
|
2.1 神经网络概述 |
8-9 |
|
2.1.1 人工神经元模型 |
8-9 |
|
2.2 BP算法学习原理 |
9-12 |
|
2.3 BP网络的逼近能力 |
12 |
|
2.4 BP网络的局限性 |
12-16 |
|
2.4.1 BP神经网络存在缺陷的原因分析 |
13-16 |
|
2.5 BP神经网络的泛化能力 |
16 |
|
2.6 BP算法的改进 |
16-25 |
|
1、用拟牛顿法改进BP学习法 |
16-18 |
|
2、用近似优变步长法对BP网络学习中的固定学习步长进行改进 |
18-20 |
|
3、用共轭梯度法对BP神经网络学习法进行改进 |
20-25 |
|
2.7 改进后BP神经学习法的收敛性分析 |
25-28 |
|
第三章 遗传算法基本原理 |
28-38 |
|
3.1 遗传算法的基本概念 |
28 |
|
3.1.1 遗传算法 |
28 |
|
3.1.2基本遗传算法 |
28 |
|
3.1.3 遗传算法的基本流程: |
28 |
|
3.2 遗传算法的模式定理 |
28-30 |
|
3.3 遗传算法收敛性分析 |
30 |
|
3.4 遗传算法算子和控制参数 |
30-31 |
|
3.4.1 遗传算法的算子 |
30 |
|
3.4.2 遗传算法的控制参数 |
30-31 |
|
3.5 遗传算法的局限性 |
31 |
|
3.6 遗传算法的改进 |
31-38 |
|
3.6.1 二进制编码方式的改进 |
32 |
|
3.6.2适应度函数的分析 |
32-33 |
|
3.6.3 自适应遗传算法的改进 |
33-35 |
|
3.6.4 交叉算子的改进 |
35-36 |
|
3.6.5 变异算子的改进 |
36-38 |
|
第四章 遗传算法与神经网络融合 |
38-42 |
|
4.1 遗传算法与神经网络融合 |
38-39 |
|
4.1.1 遗传算法优化神经网络的连接权 |
38-39 |
|
4.1.2 遗传算法优化神经网络的拓扑结构 |
39 |
|
4.1.3 遗传算法优化神经网络的学习规则 |
39 |
|
4.2 三层全局最优的BP神经网络学习模型 |
39-42 |
|
4.2.1 编码方案 |
40 |
|
4.2.2 适应度函数的确定 |
40 |
|
4.2.3 遗传操作 |
40-42 |
|
第五章 试验分析 |
42-52 |
|
5.1 对改进后BP神经网络学习收敛速度的验证 |
42-46 |
|
5.2 对改进后遗传算法的验证 |
46-48 |
|
5.3 对利用遗传算法改进BP神经网络的试验 |
48-52 |
|
参与文献 |
52-55 |
|
2.基于软计算方法的数据挖掘研究综述 |
55-102 |
|
第一部分 数据库中知识发现与数据挖掘 |
58-67 |
|
第一章 数据库中知识发现 |
58-61 |
|
1.1知识发现的基本概念 |
58 |
|
1.2知识发现的基本过程 |
58-59 |
|
1.3知识发现处理过程模型 |
59-61 |
|
1.3.1阶梯处理过程模型 |
59 |
|
1.3.2螺旋处理过程模型 |
59 |
|
1.3.3以用户为中心的处理模型 |
59-60 |
|
1.3.4联机KDD模型 |
60 |
|
1.3.5支持多数据源多知识模式的KDD处理模型 |
60-61 |
|
第二章 数据挖掘 |
61-67 |
|
2.1数据挖掘概述 |
61-63 |
|
2.1.1数据挖掘概述 |
61-62 |
|
2.1.2 KDD与DM的关系 |
62 |
|
2.1.3数据挖掘研究的理论基础 |
62-63 |
|
2.2 数据挖掘的功能 |
63-64 |
|
2.3数据挖掘的方法 |
64-67 |
|
第二部 分软计算方法 |
67-93 |
|
第三章 粗糙集理论(RS) |
67-75 |
|
3.1 基本概念 |
67-69 |
|
3.2 分辨矩阵和分辨函数 |
69-70 |
|
3.3 粗糙集理论中的知识表示 |
70-71 |
|
3.4粗糙集理论在数据挖掘中的应用 |
71-74 |
|
3.4.1连续值属性离散化问题 |
71-73 |
|
3.4.2属性约简 |
73-74 |
|
3.5规则挖掘 |
74-75 |
|
第四章 人工神经网络 |
75-85 |
|
4.1人工神经网络发展简史及分类 |
75 |
|
4.2神经网络的基本概念 |
75-78 |
|
4.1.2.1一般较常用的网络结构为前馈型网络, |
76 |
|
4.1.2.2神经网络的学习机理和机构 |
76-78 |
|
4.3神经网络的局限性 |
78 |
|
4.4神经网络BP算法的改进 |
78-80 |
|
4.4.1避免局部最小和提高收敛速度的改进改进方法 |
78-79 |
|
4.4.2隐层节点难以确定的原因 |
79-80 |
|
4.4.3 BP神经网络的泛化能力 |
80 |
|
4.5神经网络的主要特点 |
80-81 |
|
4.6神经网络的收敛性 |
81-82 |
|
4.7神经网络的应用 |
82-85 |
|
第五章 遗传算法 |
85-93 |
|
5.1遗传算法描述 |
85 |
|
5.2遗传算法的理论基础 |
85-87 |
|
5.2.1模式定理及积木块假设 |
85-87 |
|
5.2.2遗传算法收敛性分析 |
87 |
|
5.3遗传算法的研究方向 |
87 |
|
5.4 遗传算法研究进展 |
87-89 |
|
5.5遗传算法改进 |
89-93 |
|
5.5.1选择算子改进方法及技术 |
89 |
|
5.5.2交叉算予改进方法及技术 |
89 |
|
5.5.3变异算子改进方法技术 |
89-90 |
|
5.5.4适度函数的改进 |
90-91 |
|
5.5.5编码方式的改进 |
91-93 |
|
第三部 基于软计算的融合方法 |
93-96 |
|
第六章 软计算的融合方法 |
93-96 |
|
6.1粗糙集和神经网络的融合方法 |
93-94 |
|
6.2遗传算法与人工神经网络的融合方法 |
94-95 |
|
6.3神经一模糊软计算方法 |
95 |
|
6.4基于粗糙集和遗传算法的融合方法 |
95-96 |
|
参考文献 |
96-102 |
|
3. Optimization Research of BP neural network and genetic algorithm based on numerical calculation method |
102-162 |
|
Abstract |
104-106 |
|
Chapter 1 Preface |
106-108 |
|
1.1 Research of background |
106 |
|
1.2 Groundwork of this paper |
106-108 |
|
Chapter two The neural network study and improvement |
108-132 |
|
2.1 Summary of the neural network |
108-109 |
|
2.1.1 Artificial neuron model |
108-109 |
|
2.2 Principle of BP algorithm studying |
109-112 |
|
2.3 The approaching ability of the BP network |
112-113 |
|
2.4 The limitation of BP network |
113-117 |
|
2.4.1 The analysis of the reason that the BP network exists flaw |
113-117 |
|
2.5 The generalization ability of BP neural net work |
117 |
|
2.6 The improvement of the BP algorithm |
117-132 |
|
2.6.1 The Newton method |
117-118 |
|
2.6.2 The improvement to the Newton method (Quasi-Newton method) |
118-120 |
|
2.6.3 The method of the variation of step length |
120-122 |
|
2.6.4 conjugate gradient method |
122-127 |
|
2.6.5 We will give the algorithm of FR conjugate gradient method and flow chart of realizing the algorithm as follow |
127-128 |
|
2.6.6 The analysis of convergence for conjugate gradient method |
128-130 |
|
2.6.7 The total convergence of general descent algorithm |
130-132 |
|
Chapter 3 genetic algorithms basic principle |
132-145 |
|
3.1 genetic algorithms basic concept |
132-133 |
|
3.1.1 genetic algorithms |
132 |
|
3.1.2 Simple genetic algorithms |
132 |
|
3.1.3 genetic algorithms basic flow : |
132-133 |
|
3.2 genetic algorithms rationale |
133-134 |
|
3.3 genetic algorithms convergence analysis |
134-135 |
|
3.4 genetic algorithms operator and controlled parametric |
135-136 |
|
3.4.1 genetic algorithms operator |
135 |
|
3.4.2 genetic algorithms controlled parametric |
135-136 |
|
3.5 genetic algorithms limitation |
136-137 |
|
3.6 genetic algorithms improvement |
137-145 |
|
3.6.1 codes |
137-138 |
|
3.6.2 fittness functions |
138-140 |
|
3.6.3 from suitable genetic algorithms |
140-141 |
|
3.6.4 Crossover operations |
141-143 |
|
3.6.5 mutation operation |
143-145 |
|
chapter 4 genetic algorithms and nerve network fusion |
145-151 |
|
4.1 genetic algorithms and nerve network fusion |
145-147 |
|
4.1.1 genetic algorithms optimization nerve network link power |
145-146 |
|
4.1.2 genetic algorithms optimization nerve network topology |
146 |
|
4.1.3 genetic algorithms optimization nerve network study rule |
146-147 |
|
4.2 three layers overall situations most superior BP nerve network study model |
147-151 |
|
4.2.1 code schemes |
147-148 |
|
4.2.2 determination on sufficient functions |
148 |
|
4.2.3 genetic operation |
148-151 |
|
Chapter 5 Test analysis |
151-160 |
|
5.1 BP neural network test |
151-155 |
|
5.2 Verification of the genetic algorithm |
155-157 |
|
5.3 Utilize the genetic algorithm to improve the test of BP neural network |
157-160 |
|
Chapter 6 Conclusion |
160-162 |
|
4. Research survey of the data mining based on soft computing technology |
162-218 |
|
Preface |
164-165 |
|
Part 1 Knowledge Discovery and Data Mining in Databases |
165-177 |
|
Chapter 1 knowledge is discovered in databases |
165-169 |
|
1.1 Basic conception of knowledge discover |
165 |
|
1.2 Basic course of knowledge discovery |
165-166 |
|
1.3 the Dealing with the Course Model of Knowledge Discovery |
166-169 |
|
1.3.1 Deal with the course model in the ladder |
166 |
|
1.3.2 Deal with the course model in spiral |
166-167 |
|
1.3.3 Treating model of regarding user as the centre |
167 |
|
1.3.4 On-line KDD model |
167 |
|
1.3.5 KDD dealing with the model of supporting many knowledge data sources.163 Chapter 2 the Data Mining |
167-169 |
|
Chapter 2 the Data Mining |
169-177 |
|
2.1 the summary of the data mining |
169-171 |
|
2.1.1 the summary of the data mining |
169-170 |
|
2.1.2 Relation between KDD and DM |
170 |
|
2.1.3 the theoretical foundation of the data mine studied |
170-171 |
|
2.2 the Function of the data mining |
171-177 |
|
Part 2 Soft Computing Technology |
177-213 |
|
Chapter 3 Rough set theory (RS) |
177-187 |
|
3.1 Basic conception |
177-179 |
|
3.2 Distinguish matrix and distinguish function |
179-180 |
|
3.3 Collecting the knowledge in the theory coarsely expresses |
180-181 |
|
3.4 Rough set theory application in the data mining |
181-185 |
|
3.4.1 Dispersing of successive attribute |
181-184 |
|
3.4.2 Attribute Reduction |
184-185 |
|
3.5 The rule mining |
185 |
|
3.6 data mining method in improved rough set |
185-187 |
|
Chapter four Artificial neural network |
187-201 |
|
4.1 The artificial neural network develops the biref history and classification |
187-188 |
|
4.2 Basic conception of neural networks |
188-190 |
|
4.2.1 Study mechanism and organization of the neural network |
188-190 |
|
4.3 Limitation of neural networks |
190 |
|
4.4 Improvement of neural network BP algorithms |
190-195 |
|
4.4.1 Prevent from it is the part minimum and improve Convergence method of speed |
191-193 |
|
4.4.2 The reason the latent layer of nodes is intangible |
193-194 |
|
4.4.3 BP neural network ability of generation |
194-195 |
|
4.5 Main characteristic of the neural network |
195-196 |
|
4.6 Convergence property of neural networks |
196-197 |
|
4.7 Application of neural networks |
197-201 |
|
Chapter five genetic algorithm |
201-213 |
|
5.1 The genetic algorithm describing |
201-202 |
|
5.2 Theoretical foundation of the hereditary algorithm |
202-204 |
|
5.2.1 Mode theorem and building blocks hypothesis |
202-204 |
|
5.2.2 Genetic algorithm convergence property analysis on |
204 |
|
5.3 Research direction of the genetic algorithm |
204-205 |
|
5.4 Study progress in genetic algorithm |
205-207 |
|
5.5 Genetic algorithms improving |
207-213 |
|
5.5.1 Choose the operator to improve the method and technology |
208 |
|
5.5.2 Cross operator improve the method and technology |
208 |
|
5.5.3 Mutation operator improve method technology |
208-209 |
|
5.5.4 Improvement of fitness function |
209-211 |
|
5.5.5 Code method improvement |
211-213 |
|
Third part On the basis of soft computing integration method |
213-218 |
|
Chapter six the soft computing integration method |
213-218 |
|
6.1 The integration methods of rough set and neural networks |
213-215 |
|
6.2 Integration method of genetic algorithm and artificial neural network |
215-216 |
|
6.3 soft computing technology |
216-217 |
|
6.4 Integration method of collecting on the basis of being RS and genetic algorithm |
217-218 |
|
致谢 |
218 |