generated from LufsX/Challenge-kNN
This commit is contained in:
+7
-7
@@ -54,23 +54,23 @@ def classify0(inX, dataSet, labels, k=0):
|
||||
Returns:
|
||||
- int: 预测的分类标签。
|
||||
"""
|
||||
inX = np.array(inX)
|
||||
dataSet = np.array(dataSet)
|
||||
# 确保输入样本inX是numpy数组
|
||||
inX = np.array(inX)
|
||||
|
||||
# 计算输入样本与所有训练样本之间的欧几里得距离
|
||||
distances = [np.sqrt(np.sum((inX - x_train) ** 2)) for x_train in dataSet]
|
||||
|
||||
# 根据距离对训练样本进行排序,并获取前 k 个最近邻的索引
|
||||
# 根据距离对训练样本进行排序,并获取前k个最近邻的索引
|
||||
k_indices = np.argsort(distances)[:k]
|
||||
|
||||
# 根据索引获取前 k 个最近邻的标签
|
||||
# 根据索引获取前k个最近邻的标签
|
||||
k_nearest_labels = [labels[i] for i in k_indices]
|
||||
|
||||
# 使用 Counter 来找出出现次数最多的标签
|
||||
# 使用Counter找出出现次数最多的标签
|
||||
most_common = Counter(k_nearest_labels).most_common(1)
|
||||
|
||||
# 返回出现次数最多的标签(即预测的分类标签)
|
||||
return most_common[0][0]
|
||||
return most_common[0][0]
|
||||
|
||||
def load_data(file_path):
|
||||
"""
|
||||
@@ -86,7 +86,7 @@ if __name__ == "__main__":
|
||||
# 以下代码可用于测试,可自行随意修改
|
||||
|
||||
train_file = "datingTrainSet2.tsv"
|
||||
|
||||
test_file = "datingTestSet2.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