机器学习 - 最小差距算法

import numpy as np
import matplotlib.pyplot as plt
#用最小距离法(minimum distance algorithm)去检测目标点属于哪一个set


#the distance of point x and point y
def dist(x,y):
    return np.sqrt(np.sum((x - y) ** 2))

#Well-Known points to train
X_train = np.array([[1,1],[2,2.5],[3,1.2],[5.5,6.3],[6,9],[7,6]])
#Colors of each point
Y_train = ['red','red','red','blue','blue','blue']
#Testing point, to find this point is red or blue
X_test = np.array([3,4])

num = len(X_train)  # Number of points in X_train
distance = np.zeros(num)    # Numpy arrays of zeros
for i in range(num):
    distance[i] = dist(X_train[i],X_test)
print(distance)

min_index = np.argmin(distance)     # Index with smallest distance
print("The color of point X_test is %s" % (Y_train[min_index]))
print("Point X_test is close to point %s" % (X_train[min_index]))


#scatter : 散点图
plt.figure()
plt.scatter(X_train[:,0],X_train[:,1],s = 170, color = Y_train[:])      #s的意思是 假如maker是圆点 r*r = s(这里是170)
plt.scatter(X_test[0],X_test[1],s = 170, color = 'green')
plt.show()

1310818-20180422005403486-850533427.png

转载于:https://www.cnblogs.com/allen2333/p/8904732.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值