神经网络信息处理作业1

qq_37565115

已于 2023-04-03 16:07:10 修改

阅读量62

点赞数

文章标签：算法 c++ c语言

于 2023-03-16 11:40:50 首次发布

本文链接：https://blog.csdn.net/qq_37565115/article/details/129583053

版权

该代码实现了一个简单的神经网络模型，包括权重初始化、前向传播、误差计算、反向传播学习算法。网络处理4个输入样本，通过隐藏层进行计算，目标是逼近输入数据的预期输出。程序在每次迭代中更新权重，直至误差低于预设阈值。

摘要由CSDN通过智能技术生成

# define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define INPUTNO 2
#define HIDDENNO 2
#define ALPHA 1
#define MAXNO 100
#define BIGNUM 100
#define LIMIT 0.001
#define SEED 65535/*111*/

void initwh(double wh[HIDDENNO][INPUTNO + 1]);
void initwo(double wo[HIDDENNO + 1]);
int getdata(double e[][INPUTNO + 1]);
double forward(double wh[HIDDENNO][INPUTNO + 1]
	, double wo[HIDDENNO + 1], double hi[]
	, double e[INPUTNO + 1]);
void olearn(double wo[HIDDENNO + 1], double hi[]
	, double e[INPUTNO + 1], double o);
void hlearn(double wh[HIDDENNO][INPUTNO + 1]
	, double wo[HIDDENNO + 1], double hi[]
	, double e[INPUTNO + 1], double o);
void printweight(double wh[HIDDENNO][INPUTNO + 1]
	, double wo[HIDDENNO + 1]);
double s(double u);
double drand(void);

int main() {
	double wh[HIDDENNO][INPUTNO + 1];
	double wo[HIDDENNO + 1];
	double e[MAXNO][INPUTNO + 1];
	double hi[HIDDENNO + 1];
	double o;
	double err = BIGNUM;
	int i, j;
	int n_of_e;
	int count = 0;
	srand(SEED);
	initwh(wh);
	initwo(wo);
	printweight(wh, wo);
	n_of_e = getdata(e);
	printf("学习数据的个数:%d\n", n_of_e);

	while (err > LIMIT) {
		err = 0.0;
		for (j = 0; j < n_of_e; ++j) {
			o = forward(wh, wo, hi, e[j]);
			olearn(wo, hi, e[j], o);
			hlearn(wh, wo, hi, e[j], o);
			err += (o - e[j][INPUTNO])*(o - e[j][INPUTNO]);
		}
		++count;
		printf("%d\t%lf\n", count, err);
	}
	printweight(wh, wo);

	for (i = 0; i < n_of_e; ++i) {
		printf("%d", i);
		for (j = 0; j < INPUTNO + 1; ++j)
			printf("%lf", e[i][j]);
		o = forward(wh, wo, hi, e[i]);
		printf("%lf\n", o);
	}

	return 0;
}
void initwh(double wh[HIDDENNO][INPUTNO + 1]) {
	int i, j;
	for (i = 0; i < HIDDENNO; ++i)
		for (j = 0; j < INPUTNO + 1; ++j)
			wh[i][j] = drand();
}
void initwo(double wo[HIDDENNO + 1]) {
	int i;
	for (i = 0; i < HIDDENNO + 1; ++i)
		wo[i] = drand();
}
int getdata(double e[][INPUTNO + 1]) {
	int n_of_e = 4;
	e[0][0] = 0;
	e[0][1] = 0;
	e[0][2] = 1;
	e[1][0] = 0;
	e[1][1] = 1;
	e[1][2] = 1;
	e[2][0] = 1;
	e[2][1] = 0;
	e[2][2] = 1;
	e[3][0] = 1;
	e[3][1] = 1;
	e[3][2] = 0;
	return n_of_e;
}
double forward(double wh[HIDDENNO][INPUTNO + 1], double wo[HIDDENNO + 1], double hi[], double e[INPUTNO + 1]) {
	int i, j;
	double u;
	double o;

	for (i = 0; i < HIDDENNO; ++i) {
		u = 0;
		for (j = 0; j < HIDDENNO; ++j)
			u += e[j] * wh[i][j];
		u -= wh[i][j];
		hi[i] = s(u);
	}
	o = 0;
	for (i = 0; i < HIDDENNO; ++i)
		o += hi[i] * wo[i];
	o -= wo[i];
	return s(o);
}

void olearn(double wo[HIDDENNO + 1], double hi[], double e[INPUTNO + 1], double o) {
	int i;
	double  d;
	d = (e[INPUTNO] - o)*o*(1 - o);
	for (i = 0; i < HIDDENNO; ++i) {
		wo[i] += ALPHA * hi[i] * d;
	}
	wo[i] += ALPHA * (-1.0)*d;
}

void hlearn(double wh[HIDDENNO][INPUTNO + 1], double wo[HIDDENNO + 1], double hi[], double e[INPUTNO + 1], double o) {
	int i, j;
	double dj;
	for (j = 0; j < HIDDENNO; ++j) {
		dj = hi[j] * (1 - hi[j])*wo[j] * (e[INPUTNO] - o)*o*(1 - o);
		for (i = 0; i < INPUTNO; ++i)
			wh[j][i] += ALPHA * e[i] * dj;
		wh[j][i] += ALPHA * (-1.0)*dj;
	}
}

void printweight(double wh[HIDDENNO][INPUTNO + 1], double wo[HIDDENNO + 1]) {
	int i, j;
	for (i = 0; i < HIDDENNO; ++i)
		for (j = 0; j < INPUTNO + 1; ++j)
			printf("%lf ", wh[i][j]);
	printf("\n");
	for (i = 0; i < HIDDENNO + 1; ++i)
		printf("%lf ", wo[i]);
	printf("\n");
}

double s(double u) {
	return 1.0 / (1.0 + exp(-u));
}

double drand(void) {
	double rndno;
	while ((rndno = (double)rand() / RAND_MAX) == 1.0);
	rndno = rndno * 2 - 1;
	return rndno;
}

CCC