generated from LufsX/Challenge-kNN
This commit is contained in:
+37
-13
@@ -40,19 +40,33 @@ name = "陈宇杰"
|
||||
|
||||
|
||||
# 这里写自己的代码实现
|
||||
def classify0(inX, dataSet, labels, k=0):
|
||||
# KNN 分类算法
|
||||
def knn_classify(inX, dataSet, labels, k):
|
||||
"""
|
||||
KNN 分类算法。
|
||||
K-最近邻 (KNN) 算法分类输入样本。
|
||||
|
||||
Args:
|
||||
- inX (numpy array): 输入待分类的样本。
|
||||
- dataSet (numpy array): 训练数据集。
|
||||
- labels (list or numpy array): 训练集对应的标签。
|
||||
- k (int): KNN 算法参数,请自行设置默认值,评测时仅会使用其默认值。
|
||||
参数:
|
||||
inX : numpy array : 待分类的输入样本
|
||||
dataSet : numpy array : 训练数据
|
||||
labels : list : 训练数据对应的标签
|
||||
k : int : 用于分类的最近邻数量
|
||||
|
||||
Returns:
|
||||
- int: 预测的分类标签。
|
||||
返回:
|
||||
预测的分类标签。
|
||||
"""
|
||||
# 计算 inX 与所有训练数据点之间的欧几里得距离
|
||||
distances = np.linalg.norm(dataSet - inX, axis=1)
|
||||
|
||||
# 排序距离并返回前 k 个最近邻的索引
|
||||
nearest_indices = distances.argsort()[:k]
|
||||
|
||||
# 获取最近邻的标签
|
||||
nearest_labels = [labels[i] for i in nearest_indices]
|
||||
|
||||
# 使用多数投票法决定预测的类别
|
||||
predicted_label = Counter(nearest_labels).most_common(1)[0][0]
|
||||
|
||||
return predicted_label
|
||||
|
||||
|
||||
def load_data(file_path):
|
||||
@@ -65,11 +79,21 @@ def load_data(file_path):
|
||||
return features, labels
|
||||
|
||||
|
||||
def classify0(inX, dataSet, labels, k=3):
|
||||
"""
|
||||
调用 knn_classify 函数进行分类。
|
||||
"""
|
||||
return knn_classify(inX, dataSet, labels, k)
|
||||
|
||||
|
||||
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))
|
||||
# 测试分类
|
||||
test_sample = [65915, 3.868359, 0.128078]
|
||||
predicted_label = classify0(test_sample, train_data, train_labels)
|
||||
|
||||
# 打印分类结果
|
||||
print(f"测试样本 {test_sample} 的预测分类标签为: {predicted_label}")
|
||||
|
||||
Reference in New Issue
Block a user