Python贝叶斯算法简单实现

train=[[0,1,0,0,1,0,0,1,0],[1,0,0,1,0,0,1,0,0],[0,0,1,0,0,1,0,0,1],[1,1,0,1,1,0,1,1,0],[1,1,1,1,0,1,1,1,1],[0,1,1,0,1,1,0,1,1]]
label=[1,1,1,0,0,0]
test=[0,1,1,0,1,1,0,1,0]
def p_label(la):
	s=0
	for i in range(0,len(label)):
		if(label[i]==la):
			s=s+1
	if(s==0):
		p_0=(s+1)/(len(label)+1)
	else:
		p_0=s/len(label)
	#print(p_0)
	sum=[0,0,0,0,0,0,0,0,0]
	for k in range(0,len(test)):
		for j in range(0,len(label)):
			if(label[j]==la):
				if(test[k]==train[j][k]):
					sum[k]=sum[k]+1
	p_data=[0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0]
	for l in range(0,len(sum)):
		if(sum[l]==0):
			p_data[l]=(sum[l]+1)/(s+1)
		else:
			p_data[l]=sum[l]/s
	#print(p_data)
	p_all=1.0
	for f in p_data:
		p_all=p_all*f
		
	return p_all*p_0
	
if(p_label(0)>p_label(1)):
	print(0)
else:
	print(1)