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

This commit is contained in:
2024-09-26 11:01:36 +08:00
parent 9deefa4817
commit c44940de9d
+8 -12
View File
@@ -38,7 +38,7 @@ name = "吴俊煯"
# 这里写自己的代码实现 # 这里写自己的代码实现
def classify0(inX, dataSet, labels,k=4): def classify0(inX, dataSet, labels,k=3):
""" """
KNN 分类算法。 KNN 分类算法。
@@ -50,27 +50,23 @@ def classify0(inX, dataSet, labels,k=4):
Returns: Returns:
- int: 预测的分类标签。 - int: 预测的分类标签。
""" """
if dataSet.shape[0] == 0: # 特征缩放
raise ValueError("数据集为空") scaler = StandardScaler()
dataSet_scaled = scaler.fit_transform(dataSet)
inX_scaled = scaler.transform(inX.reshape(1, -1))
# 确保 k 不大于数据集的大小 # KNN 分类
k = min(k, dataSet.shape[0]) dataSetSize = dataSet_scaled.shape[0]
diffMat = np.tile(inX_scaled, (dataSetSize, 1)) - dataSet_scaled
# 计算测试样本与每个训练样本之间的距离
diffMat = np.tile(inX, (dataSet.shape[0], 1)) - dataSet
sqDiffMat = diffMat ** 2 sqDiffMat = diffMat ** 2
distances = np.sqrt(sqDiffMat.sum(axis=1)) distances = np.sqrt(sqDiffMat.sum(axis=1))
# 对距离进行排序,并获取索引
sortedDistIndicies = distances.argsort() sortedDistIndicies = distances.argsort()
# 选择距离最小的k个点
classCount = {} classCount = {}
for i in range(k): for i in range(k):
voteIlabel = labels[sortedDistIndicies[i]] voteIlabel = labels[sortedDistIndicies[i]]
classCount[voteIlabel] = classCount.get(voteIlabel, 0) + 1 classCount[voteIlabel] = classCount.get(voteIlabel, 0) + 1
# 多数投票
sortedClassCount = sorted(classCount.items(), key=lambda item: item[1], reverse=True) sortedClassCount = sorted(classCount.items(), key=lambda item: item[1], reverse=True)
return sortedClassCount[0][0] return sortedClassCount[0][0]