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

This commit is contained in:
sn
2024-10-16 19:52:34 +08:00
parent f94e51d6e6
commit a87e27842f
+30 -23
View File
@@ -39,6 +39,22 @@ name = "严锡好"
- int: 预测的分类标签。
"""
def mahalanobis_distance(x1, x2, cov_inv, mean):
"""
计算两点之间的马氏距离。
Args:
x1 (numpy array): 第一个点。
x2 (numpy array): 第二个点。
cov_inv (numpy array): 协方差矩阵的逆矩阵。
mean (numpy array): 数据集的均值。
Returns:
float: 两点之间的马氏距离。
"""
delta = x1 - x2
dist = delta @ cov_inv @ delta.T
return dist
def classify0(inX, dataSet, labels, k=3):
"""
@@ -53,37 +69,28 @@ def classify0(inX, dataSet, labels, k=3):
Returns:
- int: 预测的分类标签。
"""
# 确保输入样本 inX 是二维数组
inX = np.atleast_2d(inX)
# 计算样本数量和特征数量
numSamples, numFeatures = dataSet.shape
# 计算训练集的均值和协方差矩阵
meanVals = np.mean(dataSet, axis=0)
covMat = np.cov(dataSet, rowvar=False)
# 添加一个小的正则化项以确保协方差矩阵可逆
covMat += np.eye(numFeatures) * 0.0001
# 计算训练数据集的协方差矩阵和均值
cov_matrix = np.cov(dataSet, rowvar=False)
mean = np.mean(dataSet, axis=0)
cov_inv = np.linalg.inv(cov_matrix + np.eye(cov_matrix.shape[0]) * 1e-5) # 加上一个小的单位矩阵以避免奇异矩阵
# 计算待分类样本与训练集中每个样本的马氏距离
diffMat = dataSet - meanVals
invCovMat = np.linalg.inv(covMat)
dist = np.sum(np.dot(diffMat, invCovMat) * diffMat, axis=1)
distances = np.array([mahalanobis_distance(inX, x, cov_inv, mean) for x in dataSet])
# 获取距离最近的k个样本的索引
sortedDistIndices = np.argsort(dist)
# 获取距离最近的 k 个样本的索引
sortedDistIndices = argpartition(distances, k)[:k]
# 获取这些样本对应的标签
classCount = {}
for i in sortedDistIndices:
voteLabel = labels[i]
classCount[voteLabel] = classCount.get(voteLabel, 0) + 1
# 遍历距离最近的k个样本
for i in range(min(k, numSamples)): # 确保不会超出索引范围
voteIlabel = labels[sortedDistIndices[i]]
classCount[voteIlabel] = classCount.get(voteIlabel, 0) + 1
# 选择票数最多的类别作为预测标签
# 选择出现次数最多的标签作为预测标签
sortedClassCount = sorted(classCount.items(), key=lambda x: x[1], reverse=True)
return sortedClassCount[0][0]
def load_data(file_path):
"""
加载 TSV 格式数据文件。