自己封装的简易knn分类算法（k近邻算法）

greeneea

于 2024-09-30 00:14:37 发布

阅读量114

点赞数 2

文章标签：分类近邻算法机器学习

本文链接：https://blog.csdn.net/greeneea/article/details/142646282

版权

'''
模仿knn算法自己封装一个包(这是一个独立的KNN.py文件)
'''
import numpy as np
from math import sqrt
from collections import Counter

class knnclassifier:
    def __init__(self,k):
        self.k = k
        x_train = None
        y_train = None
    def fit(self,x_train,y_train):
        self.x_train = x_train
        self.y_train = y_train
    def predict(self,x_predict):
        y_predict = [self._predict(x) for x in x_predict]
        return np.array(y_predict)
    def _predict(self,x):
        distances = [sqrt(np.sum(x_train -x)**2)
                     for x_train in self.x_train        ]
        nearest = np.argsort(distances)
        topk_y = [self.y_train[i] for i in nearest[:self.k]]
        votes = Counter(topk_y)
        return votes.most_common(1)[0][0]
    def __repr__(self):
        return f'KNN(k={self.k})'