generated from LufsX/Challenge-kNN
This commit is contained in:
+81
-8
@@ -25,8 +25,8 @@ import numpy as np
|
||||
"""
|
||||
请在这里填写学号和姓名,不填写即成绩无效。
|
||||
"""
|
||||
id = "202210423xxx"
|
||||
name = "test_name"
|
||||
id = "202210423220"
|
||||
name = "方子涵"
|
||||
|
||||
|
||||
"""
|
||||
@@ -41,21 +41,88 @@ name = "test_name"
|
||||
|
||||
|
||||
# 这里写自己的代码实现
|
||||
def classify0(inX, dataSet, labels, k=0):
|
||||
"""
|
||||
KNN 分类算法。
|
||||
import numpy as np
|
||||
|
||||
Args:
|
||||
"""
|
||||
请在这里填写学号和姓名,不填写即成绩无效。
|
||||
"""
|
||||
id = "202210423220"
|
||||
name = "方子涵"
|
||||
|
||||
|
||||
"""
|
||||
参数说明:
|
||||
- inX (numpy array): 输入待分类的样本。
|
||||
- dataSet (numpy array): 训练数据集。
|
||||
- labels (list or numpy array): 训练集对应的标签。
|
||||
- k (int): kNN 算法参数,请**自行设置默认值**,评测时仅会使用其默认值,不修改默认值将**无法通过**评测,**成绩为零**。
|
||||
|
||||
Returns:
|
||||
返回值:
|
||||
- int: 预测的分类标签。
|
||||
"""
|
||||
|
||||
|
||||
# 这里写自己的代码实现
|
||||
import numpy as np
|
||||
|
||||
"""
|
||||
请在这里填写学号和姓名,不填写即成绩无效。
|
||||
"""
|
||||
id = "202210423220"
|
||||
name = "方子涵"
|
||||
|
||||
|
||||
def mahalanobis_distance(x1, x2, cov_inv, mean_vec):
|
||||
"""
|
||||
计算两点之间的马氏距离。
|
||||
|
||||
Args:
|
||||
x1 (numpy array): 第一个点。
|
||||
x2 (numpy array): 第二个点。
|
||||
cov_inv (numpy array): 协方差矩阵的逆矩阵。
|
||||
mean_vec (numpy array): 数据集的均值向量。
|
||||
|
||||
Returns:
|
||||
float: 两点之间的马氏距离。
|
||||
"""
|
||||
delta = x1 - x2
|
||||
dist = np.sqrt(delta.T @ cov_inv @ delta)
|
||||
return dist
|
||||
|
||||
|
||||
def classify0(inX, dataSet, labels, k=3):
|
||||
"""
|
||||
使用马氏距离的KNN分类算法。
|
||||
|
||||
Args:
|
||||
inX (numpy array): 输入待分类的样本。
|
||||
dataSet (numpy array): 训练数据集。
|
||||
labels (list or numpy array): 训练集对应的标签。
|
||||
k (int): kNN 算法参数。
|
||||
|
||||
Returns:
|
||||
int: 预测的分类标签。
|
||||
"""
|
||||
# 计算训练数据集的均值向量和协方差矩阵
|
||||
mean_vec = np.mean(dataSet, axis=0)
|
||||
cov_mat = np.cov(dataSet, rowvar=False)
|
||||
cov_inv = np.linalg.inv(cov_mat)
|
||||
|
||||
# 计算待分类样本与数据集中每个样本的马氏距离
|
||||
distances = [mahalanobis_distance(inX, x, cov_inv, mean_vec) for x in dataSet]
|
||||
|
||||
# 获取距离最近的k个样本的索引
|
||||
k_indices = np.argsort(distances)[:k]
|
||||
|
||||
# 获取这些样本对应的标签
|
||||
k_nearest_labels = labels[k_indices]
|
||||
|
||||
# 统计每个标签出现的次数
|
||||
label_counts = np.bincount(k_nearest_labels)
|
||||
|
||||
# 返回出现次数最多的标签
|
||||
return np.argmax(label_counts)
|
||||
|
||||
|
||||
def load_data(file_path):
|
||||
"""
|
||||
加载 TSV 格式数据文件。
|
||||
@@ -74,3 +141,9 @@ if __name__ == "__main__":
|
||||
train_data, train_labels = load_data(train_file)
|
||||
|
||||
print(classify0([65915, 3.868359, 0.128078], train_data, train_labels))
|
||||
|
||||
train_file = "datingTrainSet2.tsv"
|
||||
|
||||
train_data, train_labels = load_data(train_file)
|
||||
|
||||
print(classify0([65915, 3.868359, 0.128078], train_data, train_labels))
|
||||
Reference in New Issue
Block a user