generated from LufsX/Challenge-kNN
This commit is contained in:
+9
-7
@@ -41,7 +41,7 @@ name = "程悦"
|
|||||||
|
|
||||||
|
|
||||||
# 这里写自己的代码实现
|
# 这里写自己的代码实现
|
||||||
def classify0(inX, dataSet, labels, k=3):
|
def classify0(inX, dataSet, labels, k=9):
|
||||||
"""
|
"""
|
||||||
KNN 分类算法。
|
KNN 分类算法。
|
||||||
|
|
||||||
@@ -54,20 +54,22 @@ def classify0(inX, dataSet, labels, k=3):
|
|||||||
Returns:
|
Returns:
|
||||||
- int: 预测的分类标签。
|
- int: 预测的分类标签。
|
||||||
"""
|
"""
|
||||||
|
# 计算协方差矩阵并求逆矩阵
|
||||||
|
cov_matrix = np.cov(dataSet, rowvar=False)
|
||||||
|
inv_cov_matrix = np.linalg.inv(cov_matrix)
|
||||||
|
|
||||||
# 计算输入样本与训练集中每个样本的欧几里得距离
|
# 计算输入样本与训练集样本的马氏距离
|
||||||
distances = distance.cdist(dataSet, [inX], metric='euclidean').flatten()
|
distances = [distance.mahalanobis(inX, data_point, inv_cov_matrix) for data_point in dataSet]
|
||||||
|
|
||||||
# 按距离排序并选择前k个最小的距离
|
# 按距离排序并选择前 k 个最近的邻居
|
||||||
k_indices = np.argsort(distances)[:k]
|
k_indices = np.argsort(distances)[:k]
|
||||||
k_nearest_labels = [labels[i] for i in k_indices]
|
k_nearest_labels = [labels[i] for i in k_indices]
|
||||||
|
|
||||||
# 计算多数标签
|
# 统计最近邻居中最多的标签
|
||||||
label_counts = Counter(k_nearest_labels)
|
label_counts = Counter(k_nearest_labels)
|
||||||
most_common_label = label_counts.most_common(1)[0][0]
|
most_common_label = label_counts.most_common(1)[0][0]
|
||||||
|
|
||||||
return most_common_label
|
return most_common_label
|
||||||
|
|
||||||
|
|
||||||
def load_data(file_path):
|
def load_data(file_path):
|
||||||
|
|||||||
Reference in New Issue
Block a user