码迷,mamicode.com
首页 > 其他好文 > 详细

机器学习kNN

时间:2018-06-26 11:13:22      阅读:166      评论:0      收藏:0      [点我收藏+]

标签: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出现次数最多的

机器学习kNN

标签:tor   code   div   class   算法   mat   span   距离   red   

原文地址:https://www.cnblogs.com/luckygxf/p/9227046.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!