首页 > 编程语言 > 详细

Machine Learn in Action(K-近邻算法)

时间:2017-06-27 18:09:39      阅读:265      评论:0      收藏:0      [点我收藏+]

使用K-近邻算法将某点[0.6, 0.6]划分到某个类(A, B)中。

from numpy import *
import operator


def classify0(inX, dataSet, labels, k):

    dataSetSize = dataSet.shape[0]  # 数组行数
    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
    # operator.itemgetter(1)根据iterable的第二个值域排序
    sortedClassCount = sorted(classCount.items(), key=operator.itemgetter(1), reverse=True)
    return sortedClassCount[0][0]

if __name__ == __main__:
    # 定义训练集
    group = array([[1.0, 1.1], [1.0, 1.0], [0, 0], [0, 0.1]])
    labels = [A, A, B, B]
    print(classify0([0.6, 0.6], group, labels, 3))

 

Machine Learn in Action(K-近邻算法)

原文:http://www.cnblogs.com/LicwStack/p/7086305.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!