机器学习之k近邻算法

最新推荐文章于 2023-10-09 21:11:23 发布

esc_ai

最新推荐文章于 2023-10-09 21:11:23 发布

阅读量1.1k

点赞数 1

分类专栏：机器学习文章标签：机器学习

本文链接：https://blog.csdn.net/napoay/article/details/50358776

版权

机器学习专栏收录该内容

6 篇文章 0 订阅

订阅专栏

这里写图片描述

from numpy import *
import operator

def createDataSet():
    group=array([
          [1.0,1.1],
          [1.0,1.0],
          [0,0],
          [0,0.1],
          [1,0],
          [1.1,0]     
        ])
    labels=['A','A','B','B','C','C']
    return group,labels

def classify0(inX,dataSet,labels,k):
    dataSetSize=dataSet.shape[0]
    diffMat=tile(inX,(dataSetSize,1))-dataSet
    print(diffMat)
    sqDiffMat=diffMat**2;
    print(sqDiffMat)
    sqDistances=sqDiffMat.sum(axis=1)
    print(sqDistances)
    distances=sqDistances**0.5
    print(distances)
    sortedDistIndicies=distances.argsort()
    print(sortedDistIndicies)
    clasCount={}
    for i in range(k):
        print(clasCount)
        voteIlabel=labels[sortedDistIndicies[i]]
        print(voteIlabel)
        print(clasCount.get(voteIlabel,0))
        clasCount[voteIlabel]=clasCount.get(voteIlabel,0)+1
    print(clasCount)
    sortedClassCount=sorted(clasCount.iteritems(),
                     key=operator.itemgetter(1),reverse=True)
    print(sortedClassCount)
    return sortedClassCount[0][0]

group,labels=createDataSet()
print(group)
print(group.shape)
print(group.shape[0])
print(classify0([1,0],group,labels,3))