generated from LufsX/Challenge-kNN
This commit is contained in:
+1
-1
@@ -50,7 +50,7 @@ def classify0(inX, dataSet, labels, k=3):
|
|||||||
inX = (inX - np.mean(dataSet, axis=0)) / np.std(dataSet, axis=0)
|
inX = (inX - np.mean(dataSet, axis=0)) / np.std(dataSet, axis=0)
|
||||||
|
|
||||||
# 计算距离
|
# 计算距离
|
||||||
distances = [distance.euclidean(inX, x) for x in dataSet]
|
distances = np.sqrt(np.sum((dataSet - inX) ** 2, axis=1))
|
||||||
|
|
||||||
# 获取k个最近邻的索引
|
# 获取k个最近邻的索引
|
||||||
k_indices = np.argsort(distances)[:k]
|
k_indices = np.argsort(distances)[:k]
|
||||||
|
|||||||
Reference in New Issue
Block a user