generated from LufsX/Challenge-kNN
This commit is contained in:
+18
-10
@@ -55,17 +55,25 @@ def classify0(inX, dataSet, labels, k=1):
|
|||||||
Returns:
|
Returns:
|
||||||
- int: 预测的分类标签。
|
- int: 预测的分类标签。
|
||||||
"""
|
"""
|
||||||
dataSetSize=dataSet.shape[0]
|
dataSetSize = dataSet.shape[0]
|
||||||
diffMat=inX - dataSet
|
|
||||||
sqDiffMat=diffMat**2
|
# 计算协方差矩阵及其逆矩阵
|
||||||
sqDistances=sqDiffMat.sum(axis=1)
|
cov_matrix = np.cov(dataSet, rowvar=False)
|
||||||
distances=sqDistances**0.5
|
inv_cov_matrix = np.linalg.inv(cov_matrix)
|
||||||
sortedDistIndicies=distances.argsort()
|
|
||||||
classCount={}
|
# 计算马氏距离
|
||||||
|
diffMat = inX - dataSet
|
||||||
|
left_term = np.dot(diffMat, inv_cov_matrix)
|
||||||
|
mahalanobis_distances = np.sqrt(np.sum(left_term * diffMat, axis=1))
|
||||||
|
|
||||||
|
# 排序距离并选择前 k 个最近邻
|
||||||
|
sortedDistIndicies = mahalanobis_distances.argsort()
|
||||||
|
classCount = {}
|
||||||
for i in range(k):
|
for i in range(k):
|
||||||
votellabel=labels[sortedDistIndicies[i]]
|
vote_label = labels[sortedDistIndicies[i]]
|
||||||
classCount[votellabel]=classCount.get(votellabel,0)+1
|
classCount[vote_label] = classCount.get(vote_label, 0) + 1
|
||||||
sortedClassCount=sorted(classCount.items(),key=operator.itemgetter(1),reverse=True)
|
|
||||||
|
sortedClassCount = sorted(classCount.items(), key=operator.itemgetter(1), reverse=True)
|
||||||
return sortedClassCount[0][0]
|
return sortedClassCount[0][0]
|
||||||
|
|
||||||
|
|
||||||
|
|||||||
Reference in New Issue
Block a user