generated from LufsX/Challenge-kNN
This commit is contained in:
@@ -65,6 +65,7 @@ def classify0(inx, dataSet, labels, k_values=[3,8,9], _cache={"VI": None}):
|
|||||||
sortedDistIndices = np.argsort(distances)
|
sortedDistIndices = np.argsort(distances)
|
||||||
|
|
||||||
# 创建一个矩阵来保存每个k值的前k个样本的标签
|
# 创建一个矩阵来保存每个k值的前k个样本的标签
|
||||||
|
max_k = max(k_values)
|
||||||
nearest_labels = labels[sortedDistIndices[:max_k]] # 取最大的k个邻居的标签
|
nearest_labels = labels[sortedDistIndices[:max_k]] # 取最大的k个邻居的标签
|
||||||
|
|
||||||
# 为每个k值计算预测结果,统计不同k值下出现最多的标签
|
# 为每个k值计算预测结果,统计不同k值下出现最多的标签
|
||||||
|
|||||||
Reference in New Issue
Block a user