更新 function.py
Gitea Actions Challenge Test / Challenge-Actions (push) Successful in 21s

This commit is contained in:
2024-10-16 02:14:49 +08:00
parent 11ef962064
commit b68b12fcc0
-1
View File
@@ -65,7 +65,6 @@ def classify0(inx, dataSet, labels, k_values=[3,8,9], _cache={"VI": None}):
sortedDistIndices = np.argsort(distances)
# 创建一个矩阵来保存每个k值的前k个样本的标签
max_k = max(k_values) # 找到最大的k
nearest_labels = labels[sortedDistIndices[:max_k]] # 取最大的k个邻居的标签
# 为每个k值计算预测结果,统计不同k值下出现最多的标签