hao/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 11s
Details

Browse Source
This commit is contained in:
hao
2024-10-15 20:01:42 +08:00
parent 1b93a2e2f0
commit 2f530bd891
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
@@ -64,7 +64,7 @@ def classify0(inX, dataSet, labels, k=3):
# 计算待分类样本与训练集中每个样本的马氏距离 # 计算待分类样本与训练集中每个样本的马氏距离
invCovMat = np.linalg.inv(covMat) invCovMat = np.linalg.inv(covMat)
diffVecs = dataSet - meanVec diffVecs = dataSet - meanVec
dist = np.sqrt(np.sum(inX - meanVec, axis=1).dot(invCovMat).dot((inX - meanVec).T)) dist = np.sqrt(np.sum((inX - meanVec).dot(invCovMat) * (inX - meanVec), axis=1))
# 获取距离最近的 k 个样本的索引 # 获取距离最近的 k 个样本的索引
kNearestIndices = np.argsort(dist)[:k] kNearestIndices = np.argsort(dist)[:k]