yuhaopan/Challenge-kNN
1
0
Fork 0
generated from LufsX/Challenge-kNN
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

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

Browse Source
This commit is contained in:
yuhaopan
2024-10-16 10:58:35 +08:00
parent b5b4630697
commit 1728c4b3f1
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files
function.py
+1 -1
View File
@@ -66,7 +66,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个样本的标签
nearest_labels = labels[sortedDistIndices[:-1]] # 取最大的k个邻居的标签 nearest_labels = labels[sortedDistIndices[:-1]]
# 为每个k值计算预测结果，统计不同k值下出现最多的标签 # 为每个k值计算预测结果，统计不同k值下出现最多的标签
predictions = np.array([np.bincount(nearest_labels[:k]).argmax() for k in k_values]) predictions = np.array([np.bincount(nearest_labels[:k]).argmax() for k in k_values])