generated from LufsX/Challenge-kNN
This commit is contained in:
+9
-4
@@ -50,11 +50,16 @@ def classify0(inX, dataSet, labels,k=4):
|
||||
Returns:
|
||||
- int: 预测的分类标签。
|
||||
"""
|
||||
dataSetSize = dataSet.shape[0]
|
||||
diffMat = np.tile(inX, (dataSetSize, 1)) - dataSet
|
||||
if dataSet.shape[0] == 0:
|
||||
raise ValueError("数据集为空")
|
||||
|
||||
# 确保 k 不大于数据集的大小
|
||||
k = min(k, dataSet.shape[0])
|
||||
|
||||
# 计算测试样本与每个训练样本之间的距离
|
||||
diffMat = np.tile(inX, (dataSet.shape[0], 1)) - dataSet
|
||||
sqDiffMat = diffMat ** 2
|
||||
sqDistances = sqDiffMat.sum(axis=1)
|
||||
distances = sqDistances ** 0.5
|
||||
distances = np.sqrt(sqDiffMat.sum(axis=1))
|
||||
|
||||
# 对距离进行排序,并获取索引
|
||||
sortedDistIndicies = distances.argsort()
|
||||
|
||||
Reference in New Issue
Block a user