本文实例为大家分享了C++实现简单BP神经网络的具体代码，供大家参考，具体内容如下
实现了一个简单的BP神经网络
使用EasyX图形化显示训练过程和训练结果
使用了25个样本，一共训练了1万次。
该神经网络有两个输入，一个输出端
下图是训练效果，data是训练的输入数据，temp代表所在层的输出，target是训练目标，右边的大图是BP神经网络的测试结果。
以下是详细的代码实现，主要还是基本的矩阵运算。
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
|
#include <stdio.h>#include <stdlib.h>#include <graphics.h>#include <time.h>#include <math.h>#define uint unsigned short#define real double#define threshold (real)(rand() % 99998 + 1) / 100000// 神经网络的层class layer{private: char name[20]; uint row, col; uint x, y; real **data; real *bias;public: layer(){ strcpy_s(name, "temp"); row = 1; col = 3; x = y = 0; data = new real*[row]; bias = new real[row]; for (uint i = 0; i < row; i++){ data[i] = new real[col]; bias[i] = threshold; for (uint j = 0; j < col; j++){ data[i][j] = 1; } } } layer(FILE *fp){ fscanf_s(fp, "%d %d %d %d %s", &row, &col, &x, &y, name); data = new real*[row]; bias = new real[row]; for (uint i = 0; i < row; i++){ data[i] = new real[col]; bias[i] = threshold; for (uint j = 0; j < col; j++){ fscanf_s(fp, "%lf", &data[i][j]); } } } layer(uint row, uint col){ strcpy_s(name, "temp"); this->row = row; this->col = col; this->x = 0; this->y = 0; this->data = new real*[row]; this->bias = new real[row]; for (uint i = 0; i < row; i++){ data[i] = new real[col]; bias[i] = threshold; for (uint j = 0; j < col; j++){ data[i][j] = 1.0f; } } } layer(const layer &a){ strcpy_s(name, a.name); row = a.row, col = a.col; x = a.x, y = a.y; data = new real*[row]; bias = new real[row]; for (uint i = 0; i < row; i++){ data[i] = new real[col]; bias[i] = a.bias[i]; for (uint j = 0; j < col; j++){ data[i][j] = a.data[i][j]; } } } ~layer(){ // 删除原有数据 for (uint i = 0; i < row; i++){ delete[]data[i]; } delete[]data; } layer& operator =(const layer &a){ // 删除原有数据 for (uint i = 0; i < row; i++){ delete[]data[i]; } delete[]data; delete[]bias; // 重新分配空间 strcpy_s(name, a.name); row = a.row, col = a.col; x = a.x, y = a.y; data = new real*[row]; bias = new real[row]; for (uint i = 0; i < row; i++){ data[i] = new real[col]; bias[i] = a.bias[i]; for (uint j = 0; j < col; j++){ data[i][j] = a.data[i][j]; } } return *this; } layer Transpose() const { layer arr(col, row); arr.x = x, arr.y = y; for (uint i = 0; i < row; i++){ for (uint j = 0; j < col; j++){ arr.data[j][i] = data[i][j]; } } return arr; } layer sigmoid(){ layer arr(col, row); arr.x = x, arr.y = y; for (uint i = 0; i < x.row; i++){ for (uint j = 0; j < x.col; j++){ arr.data[i][j] = 1 / (1 + exp(-data[i][j]));// 1/(1+exp(-z)) } } return arr; } layer operator *(const layer &b){ layer arr(row, col); arr.x = x, arr.y = y; for (uint i = 0; i < row; i++){ for (uint j = 0; j < col; j++){ arr.data[i][j] = data[i][j] * b.data[i][j]; } } return arr; } layer operator *(const int b){ layer arr(row, col); arr.x = x, arr.y = y; for (uint i = 0; i < row; i++){ for (uint j = 0; j < col; j++){ arr.data[i][j] = b * data[i][j]; } } return arr; } layer matmul(const layer &b){ layer arr(row, b.col); arr.x = x, arr.y = y; for (uint k = 0; k < b.col; k++){ for (uint i = 0; i < row; i++){ arr.bias[i] = bias[i]; arr.data[i][k] = 0; for (uint j = 0; j < col; j++){ arr.data[i][k] += data[i][j] * b.data[j][k]; } } } return arr; } layer operator -(const layer &b){ layer arr(row, col); arr.x = x, arr.y = y; for (uint i = 0; i < row; i++){ for (uint j = 0; j < col; j++){ arr.data[i][j] = data[i][j] - b.data[i][j]; } } return arr; } layer operator +(const layer &b){ layer arr(row, col); arr.x = x, arr.y = y; for (uint i = 0; i < row; i++){ for (uint j = 0; j < col; j++){ arr.data[i][j] = data[i][j] + b.data[i][j]; } } return arr; } layer neg(){ layer arr(row, col); arr.x = x, arr.y = y; for (uint i = 0; i < row; i++){ for (uint j = 0; j < col; j++){ arr.data[i][j] = -data[i][j]; } } return arr; } bool operator ==(const layer &a){ bool result = true; for (uint i = 0; i < row; i++){ for (uint j = 0; j < col; j++){ if (abs(data[i][j] - a.data[i][j]) > 10e-6){ result = false; break; } } } return result; } void randomize(){ for (uint i = 0; i < row; i++){ for (uint j = 0; j < col; j++){ data[i][j] = threshold; } bias[i] = 0.3; } } void print(){ outtextxy(x, y - 20, name); for (uint i = 0; i < row; i++){ for (uint j = 0; j < col; j++){ COLORREF color = HSVtoRGB(360 * data[i][j], 1, 1); putpixel(x + i, y + j, color); } } } void save(FILE *fp){ fprintf_s(fp, "%d %d %d %d %s\n", row, col, x, y, name); for (uint i = 0; i < row; i++){ for (uint j = 0; j < col; j++){ fprintf_s(fp, "%lf ", data[i][j]); } fprintf_s(fp, "\n"); } } friend class network; friend layer operator *(const double a, const layer &b);};layer operator *(const double a, const layer &b){ layer arr(b.row, b.col); arr.x = b.x, arr.y = b.y; for (uint i = 0; i < arr.row; i++){ for (uint j = 0; j < arr.col; j++){ arr.data[i][j] = a * b.data[i][j]; } } return arr;}// 神经网络class network{ int iter; double learn; layer arr[3]; layer data, target, test; layer& unit(layer &x){ for (uint i = 0; i < x.row; i++){ for (uint j = 0; j < x.col; j++){ x.data[i][j] = i == j ? 1.0 : 0.0; } } return x; } layer grad_sigmoid(layer &x){ layer e(x.row, x.col); e = x*(e - x); return e; }public: network(FILE *fp){ fscanf_s(fp, "%d %lf", &iter, &learn); // 输入数据 data = layer(fp); for (uint i = 0; i < 3; i++){ arr[i] = layer(fp); //arr[i].randomize(); } target = layer(fp); // 测试数据 test = layer(2, 40000); for (uint i = 0; i < test.col; i++){ test.data[0][i] = ((double)i / 200) / 200.0f; test.data[1][i] = (double)(i % 200) / 200.0f; } } void train(){ int i = 0; char str[20]; data.print(); target.print(); for (i = 0; i < iter; i++){ sprintf_s(str, "Iterate:%d", i); outtextxy(0, 0, str); // 正向传播 layer l0 = data; layer l1 = arr[0].matmul(l0).sigmoid(); layer l2 = arr[1].matmul(l1).sigmoid(); layer l3 = arr[2].matmul(l2).sigmoid(); // 显示输出结果 l1.print(); l2.print(); l3.print(); if (l3 == target){ break; } // 反向传播 layer l3_delta = (l3 - target ) * grad_sigmoid(l3); layer l2_delta = arr[2].Transpose().matmul(l3_delta) * grad_sigmoid(l2); layer l1_delta = arr[1].Transpose().matmul(l2_delta) * grad_sigmoid(l1); // 梯度下降法 arr[2] = arr[2] - learn * l3_delta.matmul(l2.Transpose()); arr[1] = arr[1] - learn * l2_delta.matmul(l1.Transpose()); arr[0] = arr[0] - learn * l1_delta.matmul(l0.Transpose()); } sprintf_s(str, "Iterate:%d", i); outtextxy(0, 0, str); // 测试输出 // selftest(); } void selftest(){ // 测试 layer l0 = test; layer l1 = arr[0].matmul(l0).sigmoid(); layer l2 = arr[1].matmul(l1).sigmoid(); layer l3 = arr[2].matmul(l2).sigmoid(); setlinecolor(WHITE); // 测试例 for (uint j = 0; j < test.col; j++){ COLORREF color = HSVtoRGB(360 * l3.data[0][j], 1, 1);// 输出颜色 putpixel((int)(test.data[0][j] * 160) + 400, (int)(test.data[1][j] * 160) + 30, color); } // 标准例 for (uint j = 0; j < data.col; j++){ COLORREF color = HSVtoRGB(360 * target.data[0][j], 1, 1);// 输出颜色 setfillcolor(color); fillcircle((int)(data.data[0][j] * 160) + 400, (int)(data.data[1][j] * 160) + 30, 3); } line(400, 30, 400, 230); line(400, 30, 600, 30); } void save(FILE *fp){ fprintf_s(fp, "%d %lf\n", iter, learn); data.save(fp); for (uint i = 0; i < 3; i++){ arr[i].save(fp); } target.save(fp); }}; |
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
|
#include "network.h"void main(){ FILE file; FILE *fp = &file; // 读取状态 fopen_s(&fp, "Text.txt", "r"); network net(fp); fclose(fp); initgraph(600, 320); net.train(); // 保存状态 fopen_s(&fp, "Text.txt", "w"); net.save(fp); fclose(fp); getchar(); closegraph();} |
上面这段代码是在2016年初实现的，非常简陋，且不利于扩展。时隔三年，我再次回顾了反向传播算法，重构了上面的代码。
最近，参考【深度学习】一书对反向传播算法的描述，我用C++再次实现了基于反向传播算法的神经网络框架：Github: Neural-Network。该框架支持张量运算，如卷积，池化和上采样运算。除了能实现传统的stacked网络模型，还实现了基于计算图的自动求导算法，目前还有些bug。预计支持搭建卷积神经网络，并实现【深度学习】一书介绍的一些基于梯度的优化算法。
欢迎感兴趣的同学在此提出宝贵建议。
以上就是本文的全部内容，希望对大家的学习有所帮助，也希望大家多多支持服务器之家。
原文链接：https://blog.csdn.net/u014659022/article/details/51670995
