generated from LufsX/Challenge-kNN
This commit is contained in:
+38
-81
@@ -38,84 +38,41 @@ name = "邓龙树"
|
|||||||
- int: 预测的分类标签。
|
- int: 预测的分类标签。
|
||||||
"""
|
"""
|
||||||
|
|
||||||
import numpy as np
|
import numpy as np
|
||||||
|
|
||||||
def mahalanobis_distance(point1, point2, cov_inv):
|
def mahalanobis_distance(point1, point2, inv_covmat):
|
||||||
"""计算两个点之间的马氏距离。
|
"""计算两个点之间的马氏距离。"""
|
||||||
|
diff = np.array(point1) - np.array(point2)
|
||||||
Args:
|
return np.sqrt(np.dot(np.dot(diff, inv_covmat), diff.T))
|
||||||
- point1 (numpy array): 第一个点。
|
|
||||||
- point2 (numpy array): 第二个点。
|
def compute_mahalanobis_distances(dataSet, inX, inv_covmat):
|
||||||
- cov_inv (numpy array): 协方差矩阵的逆。
|
"""计算数据集中每个点与输入点inX的马氏距离。"""
|
||||||
|
distances = np.array([mahalanobis_distance(inX, dataSet[i], inv_covmat) for i in range(dataSet.shape[0])])
|
||||||
Returns:
|
return distances
|
||||||
- float: 马氏距离。
|
|
||||||
"""
|
def classify0(inX, dataSet, labels, k=3):
|
||||||
diff = np.array(point1) - np.array(point2)
|
"""KNN 分类算法,使用马氏距离。"""
|
||||||
return np.sqrt(np.dot(np.dot(diff, cov_inv), diff.T))
|
# 计算协方差矩阵的逆矩阵
|
||||||
|
covMat = np.cov(dataSet.T)
|
||||||
def compute_mahalanobis_distances(dataSet, inX, cov_inv):
|
inv_covMat = np.linalg.inv(covMat)
|
||||||
"""计算数据集中每个点与输入点inX的马氏距离。
|
|
||||||
|
distances = compute_mahalanobis_distances(dataSet, inX, inv_covMat)
|
||||||
Args:
|
sorted_indices = np.argsort(distances)
|
||||||
- dataSet (numpy array): 训练数据集。
|
k_nearest_indices = sorted_indices[:k]
|
||||||
- inX (numpy array): 输入待分类的样本。
|
k_nearest_labels = labels[k_nearest_indices]
|
||||||
- cov_inv (numpy array): 协方差矩阵的逆。
|
unique_labels, counts = np.unique(k_nearest_labels, return_counts=True)
|
||||||
|
most_common_label = unique_labels[np.argmax(counts)]
|
||||||
Returns:
|
return int(most_common_label)
|
||||||
- numpy array: 马氏距离数组。
|
|
||||||
"""
|
# 其余函数不变,包括加载数据的 load_data 和测试 KNN 算法的 test_knn
|
||||||
inX_array = np.array(inX)
|
|
||||||
distances = [mahalanobis_distance(dataSet[i], inX_array, cov_inv) for i in range(len(dataSet))]
|
if __name__ == "__main__":
|
||||||
return np.array(distances)
|
train_file_path = "path/to/datingTrainSet2.tsv" # 替换为您的训练文件路径
|
||||||
|
test_file_path = "path/to/datingTestSet2.tsv" # 替换为您的测试文件路径
|
||||||
def classify0(inX, dataSet, labels, k=3, cov_inv=None):
|
|
||||||
"""KNN 分类算法,使用马氏距离。
|
# 测试KNN算法,默认k=3
|
||||||
|
test_knn(train_file_path, test_file_path)
|
||||||
Args:
|
|
||||||
- inX (list or numpy array): 输入待分类的样本。
|
# 您可以尝试不同的k值来查看对准确率的影响
|
||||||
- dataSet (numpy array): 训练数据集。
|
# test_knn(train_file_path, test_file_path, k=5)
|
||||||
- labels (numpy array): 训练集对应的标签。
|
# test_knn(train_file_path, test_file_path, k=1)
|
||||||
- k (int): KNN 算法参数,表示选择最近的k个邻居,默认值为3。
|
|
||||||
- cov_inv (numpy array): 协方差矩阵的逆,如果为None则使用欧氏距离。
|
|
||||||
|
|
||||||
Returns:
|
|
||||||
- int: 预测的分类标签。
|
|
||||||
"""
|
|
||||||
if cov_inv is not None:
|
|
||||||
distances = compute_mahalanobis_distances(dataSet, inX, cov_inv)
|
|
||||||
else:
|
|
||||||
distances = compute_distances(dataSet, inX) # 使用原有的欧氏距离计算函数
|
|
||||||
|
|
||||||
sorted_indices = np.argsort(distances)
|
|
||||||
k_nearest_indices = sorted_indices[:k]
|
|
||||||
k_nearest_labels = labels[k_nearest_indices]
|
|
||||||
unique_labels, counts = np.unique(k_nearest_labels, return_counts=True)
|
|
||||||
most_common_label = unique_labels[np.argmax(counts)]
|
|
||||||
return int(most_common_label)
|
|
||||||
|
|
||||||
# ... (load_data 和 test_knn 函数保持不变)
|
|
||||||
|
|
||||||
if __name__ == "__main__":
|
|
||||||
train_file_path = "path/to/datingTrainSet2.tsv" # 替换为您的训练文件路径
|
|
||||||
test_file_path = "path/to/datingTestSet2.tsv" # 替换为您的测试文件路径
|
|
||||||
|
|
||||||
# 加载数据
|
|
||||||
train_data, train_labels = load_data(train_file_path)
|
|
||||||
if train_data is None or train_labels is None:
|
|
||||||
print("Failed to load training data.")
|
|
||||||
exit()
|
|
||||||
|
|
||||||
# 计算协方差矩阵及其逆
|
|
||||||
cov_matrix = np.cov(train_data.T)
|
|
||||||
cov_inv = np.linalg.inv(cov_matrix)
|
|
||||||
|
|
||||||
# 测试KNN算法,使用马氏距离,默认k=3
|
|
||||||
accuracy = test_knn(train_file_path, test_file_path, k=3, cov_inv=cov_inv)
|
|
||||||
|
|
||||||
# 注意:由于test_knn函数中没有直接传递cov_inv,我们需要修改它以便能够传递这个参数。
|
|
||||||
# 下面的修改是假设在test_knn函数中添加了一个cov_inv参数,并在调用classify0时传递了它。
|
|
||||||
# (实际代码中需要对test_knn函数进行相应修改,这里只是说明思路)
|
|
||||||
# ...
|
|
||||||
# 修改后的test_knn函数调用示例(需要在函数定义中添加cov_inv参数):
|
|
||||||
# accuracy = test_knn(train_file_path, test_file_path, k=3, cov_inv=cov_inv)
|
|
||||||
|
|||||||
Reference in New Issue
Block a user