generated from LufsX/Challenge-kNN
This commit is contained in:
+65
-37
@@ -25,8 +25,8 @@ import numpy as np
|
||||
"""
|
||||
请在这里填写学号和姓名,不填写即成绩无效。
|
||||
"""
|
||||
id = "202210423xxx"
|
||||
name = "test_name"
|
||||
id = "202210423222"
|
||||
name = "邓龙树"
|
||||
|
||||
|
||||
"""
|
||||
@@ -38,38 +38,66 @@ name = "test_name"
|
||||
- int: 预测的分类标签。
|
||||
"""
|
||||
|
||||
|
||||
# 这里写自己的代码实现
|
||||
def classify0(inX, dataSet, labels, k=0):
|
||||
"""
|
||||
KNN 分类算法。
|
||||
|
||||
Args:
|
||||
- inX (numpy array): 输入待分类的样本。
|
||||
- dataSet (numpy array): 训练数据集。
|
||||
- labels (list or numpy array): 训练集对应的标签。
|
||||
- k (int): KNN 算法参数,请自行设置默认值,评测时仅会使用其默认值。
|
||||
|
||||
Returns:
|
||||
- int: 预测的分类标签。
|
||||
"""
|
||||
|
||||
|
||||
def load_data(file_path):
|
||||
"""
|
||||
加载 TSV 格式数据文件。
|
||||
"""
|
||||
data = np.loadtxt(file_path, delimiter="\t")
|
||||
features = data[:, :-1]
|
||||
labels = data[:, -1].astype(int)
|
||||
return features, labels
|
||||
|
||||
|
||||
if __name__ == "__main__":
|
||||
# 以下代码可用于测试,可自行随意修改
|
||||
|
||||
train_file = "datingTrainSet2.tsv"
|
||||
|
||||
train_data, train_labels = load_data(train_file)
|
||||
|
||||
print(classify0([65915, 3.868359, 0.128078], train_data, train_labels))
|
||||
import numpy as np
|
||||
|
||||
def euclidean_distance(point1, point2):
|
||||
"""
|
||||
计算两个点之间的欧氏距离。
|
||||
"""
|
||||
return np.sqrt(np.sum((point1 - point2) ** 2))
|
||||
|
||||
def classify0(inX, dataSet, labels, k=3):
|
||||
"""
|
||||
KNN 分类算法。
|
||||
|
||||
Args:
|
||||
- inX (numpy array): 输入待分类的样本。
|
||||
- dataSet (numpy array): 训练数据集。
|
||||
- labels (list or numpy array): 训练集对应的标签。
|
||||
- k (int): KNN 算法参数,默认值为3。
|
||||
|
||||
Returns:
|
||||
- int: 预测的分类标签。
|
||||
"""
|
||||
# 计算待分类样本与训练集中每个样本之间的距离
|
||||
distances = [euclidean_distance(inX, x) for x in dataSet]
|
||||
|
||||
# 对距离进行排序,并获取距离最小的k个样本的索引
|
||||
sorted_indices = np.argsort(distances)
|
||||
k_nearest_indices = sorted_indices[:k]
|
||||
|
||||
# 获取k个最近样本的标签
|
||||
k_nearest_labels = [labels[i] for i in k_nearest_indices]
|
||||
|
||||
# 统计每个标签出现的次数,并返回出现次数最多的标签
|
||||
label_counts = np.bincount(k_nearest_labels)
|
||||
predicted_label = np.argmax(label_counts)
|
||||
|
||||
return predicted_label
|
||||
|
||||
def load_data(file_path):
|
||||
"""
|
||||
加载 TSV 格式数据文件。
|
||||
"""
|
||||
data = np.loadtxt(file_path, delimiter="\t")
|
||||
features = data[:, :-1]
|
||||
labels = data[:, -1].astype(int)
|
||||
return features, labels
|
||||
|
||||
if __name__ == "__main__":
|
||||
# 测试代码
|
||||
train_file = "datingTrainSet2.tsv"
|
||||
test_file = "datingTestSet2.tsv" # 假设有一个测试文件用于验证,虽然题目没明确要求
|
||||
|
||||
# 加载训练数据和测试数据
|
||||
train_data, train_labels = load_data(train_file)
|
||||
# test_data, test_labels = load_data(test_file) # 如果需要测试,可以取消注释并添加相应的测试代码
|
||||
|
||||
# 测试 classify0 函数
|
||||
sample = [65915, 3.868359, 0.128078] # 示例样本
|
||||
predicted_label = classify0(sample, train_data, train_labels)
|
||||
print(f"Predicted label for sample {sample}: {predicted_label}")
|
||||
|
||||
# 如果需要测试整个测试集,可以添加以下代码(注意:这部分代码是为了完整性而添加的,题目没明确要求)
|
||||
# accuracy = np.mean([classify0(test_data[i], train_data, train_labels) == test_labels[i] for i in range(len(test_data))])
|
||||
# print(f"Accuracy on test set: {accuracy}")
|
||||
|
||||
Reference in New Issue
Block a user