KNN-K近邻算法
建立关于特征的数学模型,判断待标签样本,与已知样本进行“距离”计算。然后通过取最近K个值中标签数量最多一个,作为新样本标签。
'''
函数解释:
tile(Mat,(x,y)):向下x个单位右y个单位复制Mat
diffMat**2 = pow(diffMat,2)
sum(axis=1)横向求sum,sum(axis=0)纵向求sum
argsort()按从小到大排序后返回该值在原数组的索引
'''
import numpy as np
import operator
def CreateDataSet():
group = np.array([[1.0, 1.1], [1.0, 1.0], [0, 0], [0, 0.1]])
labels =['A', 'A', 'B', 'B']
return group, labels
def classify0(inX, dataSet, labels, k):
dataSetSize = dataSet.shape[0]
diffMat = np.tile(inX, (dataSetSize, 1))-dataSet
sqDiffMat = diffMat**2
sqDistances = sqDiffMat.sum(axis=1)
distances = sqDistances**0.5
sortedDistIndicies = distances.argsort()
classCount = {}
for i in range(k):
voteIlabel = labels[sortedDistIndicies[i]]
classCount[voteIlabel] = classCount.get(voteIlabel, 0) + 1
sortedClassCount = sorted(classCount.items(), key=operator.itemgetter(1), reverse=True)
return sortedClassCount[0][0]
def main():
group, labels = CreateDataSet()
a = classify0([0, 0], group, labels, 3)
print(a)
if __name__ == '__main__':
main()
pass
KNN识别手写数字
关键在于如何把图像转换成向量:(下面是网上看到的方法,认为没有什么特别处理方法)
def img2vector(filename):
rows = 32
cols = 32
imgVector = zeros((1, rows * cols))
fileIn = open(filename)
for row in xrange(rows):
lineStr = fileIn.readline()
for col in xrange(cols):
imgVector[0, row * 32 + col] = int(lineStr[col])
return imgVector
总体来说KNN实现起来比较简单,但是每次的判断都要重新处理,会有大量的时间浪费。