generated from LufsX/Challenge-kNN
This commit is contained in:
+3
-3
@@ -41,7 +41,7 @@ name = "Tanjunfeng"
|
||||
|
||||
|
||||
# 这里写自己的代码实现
|
||||
def classify0(inX, dataSet, labels, k=0):
|
||||
def classify0(inX, dataSet, labels, k=3):
|
||||
"""
|
||||
KNN 分类算法。
|
||||
|
||||
@@ -54,7 +54,7 @@ def classify0(inX, dataSet, labels, k=0):
|
||||
Returns:
|
||||
- int: 预测的分类标签。
|
||||
"""
|
||||
# 计算输入向量与训练集中每一个样本的欧式距离
|
||||
# 计算输入向量与训练集中每一个样本的欧式距离
|
||||
distances = np.sqrt(np.sum((dataSet - inX) ** 2, axis=1))
|
||||
|
||||
# 通过对距离进行升序排序并选择前k个最近距离的索引
|
||||
@@ -65,7 +65,7 @@ def classify0(inX, dataSet, labels, k=0):
|
||||
|
||||
# 使用计数器查找出现频率最高的标签
|
||||
most_common_label = Counter(nearest_labels).most_common(1)[C_0]()[C_0]()
|
||||
|
||||
|
||||
return most_common_label
|
||||
|
||||
def load_data(file_path):
|
||||
|
||||
Reference in New Issue
Block a user