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

This commit is contained in:
2024-10-11 20:13:45 +08:00
parent 0c71a39b4f
commit 3be0dbc035
+5 -5
View File
@@ -1,6 +1,6 @@
# function.py
import numpy as np
from scipy.spatial.distance import mahalanobis
"""
挑战说明:
- 自行编写实现 KNN 分类算法。
@@ -40,7 +40,7 @@ name = "尹家立"
# 这里写自己的代码实现
def classify0(inX, dataSet, labels, k=0):
def classify0(inX, dataSet, labels, k=3):
"""
KNN 分类算法。
@@ -58,9 +58,9 @@ def classify0(inX, dataSet, labels, k=0):
invCovMat = np.linalg.inv(covMat) # 计算协方差矩阵的逆
# Step 2: 计算马氏距离
diffMat = dataSet - inX # 计算差值矩阵
left = np.dot(diffMat, invCovMat) # 左乘协方差矩阵的逆
mahalanobisDist = np.sqrt(np.sum(left * diffMat, axis=1)) # 计算马氏距离
mahalanobisDist = np.array([
mahalanobis(inX, dataSet[i], invCovMat) for i in range(dataSet.shape[0])
]) # 使用 scipy 的 mahalanobis 函数计算马氏距离
# Step 3: 按距离排序,得到索引
sortedDistIndices = mahalanobisDist.argsort()