登录
首页 » 算法 » KNN最邻近分类算法

KNN最邻近分类算法

于 2022-07-09 发布 文件大小:342.74 kB
0 188
下载积分: 2 下载次数: 1

代码说明:

改代码是由python编写的,实现了机器学习中最常用的、最简单的最邻近算法(KNN)。其中,附带有验证用的数据集,可以验证算法的效果。

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 乌纽什可爱休克五夜
    应用背景不要nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdo关键技术不要nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdo
    2022-04-18 18:05:30下载
    积分:1
  • 最近邻查找
    本源码主要是提供了传统k-means算法以及利用近似k_d树算法进行加速的聚类算法。
    2022-03-21 09:51:13下载
    积分:1
  • 边缘检测代码
    源码是关于边缘检测的代码,可以对检测图像中的边缘,能够很好的对一些非边缘物体进行图像的基本处理,使之消失 ,不影响整个边缘的检测!!!!!
    2023-04-18 22:00:03下载
    积分:1
  • This code can generate a series of random numbers, and then the number of these...
    此代码可以生成一系列随机数,然后对这些随机数进行快速排序。-This code can generate a series of random numbers, and then the number of these random quick sort.
    2022-03-20 18:48:10下载
    积分:1
  • Least Soft-thresold Squares Tracking
    we propose a generative tracking method based on a novel robust linear regression algorithm. In con- trast to existing methods, the proposed Least Soft-thresold Squares (LSS) algorithm models the error term with the Gaussian-Laplacian distribution, which can be solved ef- ficiently. Based on maximum joint likelihood of parameters, we derive a LSS distance to measure the difference between an observation sample and the dictionary. Compared with the distance derived from ordinary least squares methods, the proposed metric is more effective
    2022-03-22 17:30:20下载
    积分:1
  • 用C语言来实现的。求解线性方程组的迭代,是一种简单的迭代,可不如 Gauss...
    用C语言来实现的。求解线性方程组的迭代,是一种简单的迭代法,可不如 Gauss-Seidel迭代法收敛速度快。-Use c language to make a Jacobi iterative arithmetic which could solve the linear equation group, but it s may be more slower than the Gauss-Seidel iterative arithmetic.
    2022-10-31 15:55:02下载
    积分:1
  • 格路问题:经典的分析与设计题目,用动态规划的方解决从一个网格起点到终点的最短路径问题...
    格路问题:经典的算法分析与设计题目,用动态规划的方法解决从一个网格起点到终点的最短路径问题-Lattice path problem: the classical algorithm analysis and design topics, with the dynamic programming solution to start from a grid to the end of the shortest path problem
    2022-07-04 01:17:42下载
    积分:1
  • machine learning tom Tests author of books on the code
    机器学习作者tom mitchell的书上代码-machine learning tom Tests author of books on the code
    2022-11-28 00:00:03下载
    积分:1
  • 用差分方求解沃尔泰拉方程,此处为一个变元的方程,由于该方程同时含有微分和积分,一般求解有一定的困难。...
    用差分方法求解沃尔泰拉方程,此处为一个变元的方程,由于该方程同时含有微分和积分,一般求解有一定的困难。-use of the finite difference method for Volterra equation here as a variable element of the equation, As the same time contain differential equations and integral, the general solution is definitely difficult.
    2022-01-27 16:39:27下载
    积分:1
  • loki 程序库
    loki 程序库-loki library
    2022-07-26 04:02:17下载
    积分:1
  • 696518资源总数
  • 106215会员总数
  • 5今日下载