knn算法核心代码

最新推荐文章于 2022-07-16 08:00:00 发布

weixin_42673583

最新推荐文章于 2022-07-16 08:00:00 发布

阅读量753

点赞数

文章标签：算法机器学习深度学习

本文链接：https://blog.csdn.net/weixin_42673583/article/details/122766583

版权

本文深入探讨k近邻(knn)算法，揭示其核心思想。初看复杂，实际理解后，你会发现knn算法十分直观易懂。通过实例解析算法细节，带你轻松掌握这一基础机器学习方法。

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

    def predict_labels(self, dists, k=1):
        print("predict_labels")
        """
        Given a matrix of distances between test points and training points,
        predict a label for each test point.

        Inputs:
        - dists: A numpy array of shape (num_test, num_train) where dists[i, j]
          gives the distance betwen the ith test point and the jth training point.

        Returns:
        - y: A numpy array of shape (num_test,) containing predicted labels for the
          test data, where y[i] is the predicted label for the test point X[i].
        """
        num_test = dists.shape[0