generated from LufsX/Experiment-kNN
This commit is contained in:
+2
-2
@@ -63,8 +63,8 @@ def classify(input_vector, dataSet, labels, k=3):
|
||||
# 按距离升序排列,选出距离最小的k个点的索引
|
||||
nearest_neighbors = distances.argsort()[:k]
|
||||
|
||||
# 获取这k个邻居的标签
|
||||
neighbor_labels = [labels[i] for i in nearest_neighbors]
|
||||
# 获取这k个邻居的标签,并转为列表
|
||||
neighbor_labels = list(labels[nearest_neighbors])
|
||||
|
||||
# 返回出现次数最多的标签
|
||||
predicted_label = max(set(neighbor_labels), key=neighbor_labels.count)
|
||||
|
||||
Reference in New Issue
Block a user