generated from LufsX/Experiment-kNN
This commit is contained in:
+27
-44
@@ -1,7 +1,6 @@
|
||||
# function.py
|
||||
import numpy as np
|
||||
import os
|
||||
from collections import defaultdict
|
||||
|
||||
"""
|
||||
实验说明:
|
||||
@@ -44,46 +43,31 @@ name = "熊浩燃"
|
||||
# 这里写自己的代码实现
|
||||
def classify(input_vector, dataSet, labels, k=3):
|
||||
"""
|
||||
KNN 分类算法优化版。
|
||||
KNN 分类算法。
|
||||
|
||||
Args:
|
||||
- input_vector (numpy array): 输入待分类的样本。
|
||||
- dataSet (numpy array): 训练数据集。
|
||||
- labels (list or numpy array): 训练集对应的标签。
|
||||
- k (int): kNN 算法参数,默认值为 3。
|
||||
- k (int): kNN 算法参数,请**自行设置默认值**,评测时仅会使用其默认值,不修改默认值将**无法通过**评测,**成绩为零**。
|
||||
|
||||
Returns:
|
||||
- int: 预测的分类标签。
|
||||
"""
|
||||
# 使用高效的向量化操作计算距离(欧氏距离)
|
||||
# 为了加速,可以使用平方距离避免开方操作,因为排序不受影响
|
||||
distances = np.sum((dataSet - input_vector) ** 2, axis=1)
|
||||
|
||||
# 计算欧氏距离
|
||||
distances = np.linalg.norm(dataSet - input_vector, axis=1)
|
||||
# 获取距离最近的 k 个样本的索引
|
||||
nearest_neighbors_indices = np.argpartition(distances, k)[:k]
|
||||
|
||||
nearest_neighbors_indices = distances.argsort()[:k]
|
||||
# 获取这些样本的标签
|
||||
nearest_labels = labels[nearest_neighbors_indices]
|
||||
|
||||
# 使用字典统计每个标签的出现次数,避免 np.bincount 的限制(例如标签不是非负整数)
|
||||
label_count = defaultdict(int)
|
||||
for label in nearest_labels:
|
||||
label_count[label] += 1
|
||||
|
||||
# 找到出现次数最多的标签
|
||||
# 如果有多个标签出现次数相同,选择距离最近的那个
|
||||
max_count = -1
|
||||
predicted_label = None
|
||||
for label in nearest_labels:
|
||||
if label_count[label] > max_count:
|
||||
max_count = label_count[label]
|
||||
predicted_label = label
|
||||
|
||||
nearest_labels = np.array(labels)[nearest_neighbors_indices]
|
||||
# 统计出现次数最多的标签并返回
|
||||
predicted_label = np.bincount(nearest_labels).argmax()
|
||||
return predicted_label
|
||||
|
||||
# 这里也写自己的代码实现
|
||||
def load_data(directory):
|
||||
def load_dataset(directory):
|
||||
"""
|
||||
从文件夹中加载数据,优化后的版本。
|
||||
从文件夹中加载数据,若不自行正确实现,则无法通过评测,**不记录成绩**。
|
||||
|
||||
Args:
|
||||
- directory (str): 数据文件夹路径。
|
||||
@@ -94,23 +78,19 @@ def load_data(directory):
|
||||
"""
|
||||
labels = []
|
||||
data_list = []
|
||||
|
||||
# 预分配内存以加速
|
||||
filenames = [filename for filename in os.listdir(directory) if filename.endswith(".txt")]
|
||||
num_files = len(filenames)
|
||||
data_list = np.zeros((num_files, 1024), dtype=int)
|
||||
labels = np.zeros(num_files, dtype=int)
|
||||
|
||||
for idx, filename in enumerate(filenames):
|
||||
labels[idx] = int(filename.split('_')[0])
|
||||
data_list[idx] = img_to_vector(os.path.join(directory, filename))
|
||||
|
||||
return data_list, labels
|
||||
for filename in os.listdir(directory):
|
||||
if filename.endswith(".txt"): # 确保读取的是 txt 文件
|
||||
label = int(filename.split('_')[0])
|
||||
labels.append(label)
|
||||
vector = img_to_vector(os.path.join(directory, filename))
|
||||
data_list.append(vector)
|
||||
return np.array(data_list), np.array(labels)
|
||||
|
||||
# 这里还写自己的代码实现
|
||||
def img_to_vector(filename):
|
||||
"""
|
||||
将二值图像转换为向量,优化后的版本。
|
||||
将二值图像转换为向量。
|
||||
该部分应为 load_dataset 函数的辅助子函数,可单独在这里实现,也可直接集成至 load_dataset 函数中。
|
||||
|
||||
Args:
|
||||
- filename (str): 图像文件路径。
|
||||
@@ -118,15 +98,18 @@ def img_to_vector(filename):
|
||||
Returns:
|
||||
- np.array: 二值图像向量。
|
||||
"""
|
||||
with open(filename, 'r') as f:
|
||||
lines = f.read().replace('\n', '')
|
||||
vector = np.array(list(lines), dtype=int)
|
||||
with open(filename, 'r') as f: # 确保使用文本模式读取
|
||||
lines = f.readlines()
|
||||
vector = np.zeros((1024,), dtype=int) # 将其改为 (1024,) 的一维数组
|
||||
for i in range(32):
|
||||
for j in range(32):
|
||||
vector[32 * i + j] = int(lines[i][j])
|
||||
return vector
|
||||
|
||||
|
||||
if __name__ == "__main__":
|
||||
# 测试代码
|
||||
train_data, train_labels = load_data("trainingDigits")
|
||||
train_data, train_labels = load_dataset("trainingDigits")
|
||||
|
||||
test_data = (
|
||||
"00000000000000110000000000000000"
|
||||
|
||||
Reference in New Issue
Block a user