hhhjhhh1122的博客

原创 随机梯度下降

import numpy as npimport randomh0 = np.random.random()h1 = np.random.random()h2 = np.random.random()h = np.array([h1,h2])x=np.array([[2014,3],[1600,3],[2400,2],[1416,2],[3000,4]])t=np.array([400,330,369,232,540])a = 0.001eps = 1e-4e0 = 10e1 = 10

原创 kmeans算法推导1

原创 决策树推导2021-10-26

转载 强化学习。

# 查看当前挂载的数据集目录, 该目录下的变更重启环境后会自动还原# View dataset directory. # This directory will be recovered automatically after resetting environment. !ls /home/aistudio/data# 查看工作区文件, 该目录下的变更将会持久保存. 请及时清理不必要的文件, 避免加载过慢.# View personal work directory. # All chang

转载 手写体识别

# 查看当前挂载的数据集目录, 该目录下的变更重启环境后会自动还原# View dataset directory. # This directory will be recovered automatically after resetting environment. !ls /home/aistudio/data# 查看工作区文件, 该目录下的变更将会持久保存. 请及时清理不必要的文件, 避免加载过慢.# View personal work directory. # All chang

原创 卷积神经网络图像分类

# 查看当前挂载的数据集目录, 该目录下的变更重启环境后会自动还原# View dataset directory. # This directory will be recovered automatically after resetting environment. !ls /home/aistudio/data# 查看工作区文件, 该目录下的变更将会持久保存. 请及时清理不必要的文件, 避免加载过慢.# View personal work directory. # All chang

原创 PCA实例

import numpy as npx=np.array([2.5,0.5,2.2,1.9,3.1,2.3,2,1,1.5,1.1])y=np.array([2.4,0.7,2.9,2.2,3.0,2.7,1.6,1.1,1.6,0.9])sum1=0sum2=0for i in range(0,10): sum1+=x[i] sum2+=y[i]x_ave=sum1/10y_ave=sum2/10print(x_ave)print(y_ave)1.811.90999

原创 隐马尔科夫链

import numpy as npR0=0.6S0=0.4R1=R0*0.1S1=S0*0.6l=np.array([[0.4,0.3], [0.5,0.1]]) tran=np.array([[0.7,0.4], #R-R R-S [0.3,0.6]]) #S-R S-Sp1=R1*l[0,0]*tran[0,0] #R-Rp2=S1*l[0,0]*tran[0,1] #S-Rp3=R1*l[0,1]*tran[1,0] #R

原创 隐马尔科夫链推导

题目：我前天公园散步、昨天购物、今天清理房间states = ('Rainy', 'Sunny') observations = ('walk', 'shop', 'clean') start_probability = {'Rainy': 0.6, 'Sunny': 0.4} transition_probability = { 'Rainy' : {'Rainy': 0.7, 'Sunny': 0.3}, 'Sunny' : {'Rainy': 0.4, 'Sunn

原创 全连接神经网络

import numpy as npimport randomimport mathx=np.array([[1], [2], [3]])t8=2t9=3def sig(x): sigmoid=1/(1+math.e**(-x)) return sigmoideps = 1e-4e0 = 0.01e1 = 0.01e2 = 0.01b=0.01for i in range(10): while e0>=

原创 欧拉公式改进（Euler2）

import matplotlib.pyplot as pltimport numpy as npxx=np.zeros(100)yy=np.zeros(100)x=0y=1t=0.1i=1for i in range(100): k=y-2*x/y x=x+t y1=y+t*k k1=y1-2*x/y1 y=y+t*(k+k1)/2 print(x,y) xx[i]=x yy[i]=yplt.plot(xx,yy)0.

原创 神经网络全连接 权重梯度推导

原创 朴素贝叶斯公式 实例推导

原创 欧拉公式求解

import matplotlib.pyplot as pltimport numpy as npx=0y=1d=1xx=np.zeros(100)yy=np.zeros(100)i=0for i in range(100): x=x+0.01 y=y+d d=y-(2*x/y) print(x,y) xx[i] = x yy[i] = yplt.plot(xx,yy)0.01 20.02 3.990.03 7.9699749373

原创 感知器算法

import numpy as npimport randomimport mathw1 = np.random.random()w2 = np.random.random()x=np.array([[0,0], [0,1], [1,0], [1,1]])t=np.array([[0], [0], [0], [1]])w0=0a = 0.01eps

原创 监督学习。

import numpy as npimport matplotlib.pyplot as plth0 = np.random.random()h1 = np.random.random()h2 = np.random.random()h = np.array([h1,h2])x=np.array([[2014,3],[1600,3],[2400,2],[1416,2],[3000,4]])t=np.array([400,330,369,232,540])a = 0.001eps = 1

转载 Untitled5 (1)

import numpy as npnp.vsplit(c,3)[array([[1, 2], [3, 4]]), array([[5, 6], [7, 8]]), array([[ 9, 10], [11, 12]])]垂直拆分：numpy.vsplit(数组，份数)->(数组片段)import numpy as npc = np.arange(1,13).reshape(6,2)carray([[ 1, 2],