fast !!!!
Gitea Actions Challenge Test / Challenge-Actions (push) Successful in 10s

This commit is contained in:
2024-10-09 01:14:58 +08:00
parent e3f04c4443
commit cdcdff482e
+1 -1
View File
@@ -61,7 +61,7 @@ def classify0(inX, dataSet, labels, k=8, _cache={"VI": None, "dataSet": None}):
diff = dataSet - inX
# 使用矩阵运算计算马氏距离
distances = np.einsum("ij,jk,ik->i", diff, _cache["VI"], diff)
distances = np.sum(diff @ _cache["VI"] * diff, axis=1)
# 对距离排序,获取前 k 个最近的样本索引
sortedDistIndices = np.argpartition(distances, 8)[:8]