标签:tor code div class 算法 mat span 距离 red
from numpy import * import operator def createDataSet(): group = 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] print dataSetSize diffMat = 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 soredClassCount = sorted(classCount.iteritems(), key = operator.itemgetter(1), reverse = True) return soredClassCount[0][0] if __name__=="__main__": group, labels = createDataSet() res = classify0([0,0], group, labels, 3) print res
kNN算法,找出距离最近的k个,label出现次数最多的
标签:tor code div class 算法 mat span 距离 red
原文地址:https://www.cnblogs.com/luckygxf/p/9227046.html