kNN最近邻分类器

最新推荐文章于 2022-11-10 11:24:25 发布

海涛anywn

最新推荐文章于 2022-11-10 11:24:25 发布

阅读量1.1k

点赞数

分类专栏：机器学习算法

本文链接：https://blog.csdn.net/lihaitao000/article/details/51221344

版权

本文展示了如何利用Python实现kNN(k-Nearest Neighbor)最近邻分类器。首先定义了创建数据集的函数createDataSet，接着构建了kNNClassify函数，该函数通过计算距离并选择最近的k个邻居进行投票来确定分类。最后，通过两个测试样例展示了分类器的工作原理。

摘要由CSDN通过智能技术生成

from numpy import *
import operator
#初始化数据集
def createDataSet():
    group = array([[1.0,0.9],[1.0,1.0],[0.1,0.1],[0.0,0.1]])
    labels = ['A','A','B','B']
    return group,labels
#构建KNN分类器
def kNNClassify(newInput,dataSet,labels,k):
    numSamples = dataSet.shape[0]

    diff = tile(newInput,(numSamples,1)) - dataSet
    squaredDiff = diff ** 2
    squaredDist = sum(squaredDiff,axis = 1)
    distance = squaredDist ** 0.5

    sortedDistIndices = argsort(distance)

    classCount = {}

    for i in xrange(k):
        voteLabel = labels[sortedDistIndices[i]]

        classCount[voteLabel] = classCount.get(voteLabel,0) + 1

    maxCount = 0
    for key,value in classCount.items():
        if value > maxCount:
            maxCount = value
            maxIndex = key
            
    return maxIndex