最近邻
K-近邻(待会介绍)的一种极端情况。“近朱者赤,近墨者黑”。
def distance(p0, p1):
# Computes squared euclidean distance
return np.sqrt(np.sum((p0-p1)**2))
def nn_classify(training_set, training_labels, new_example):
dists = np.array([distance(t, new_example) for t in training_set])
nearest = dists.argmin()
return training_labels[nearest]
K近邻
将上述的最近邻算法泛化为一个k近邻分类器,不仅考虑最近邻的点,