登录
首页 » C++ » knn回归实现

knn回归实现

于 2022-08-05 发布 文件大小:2.06 kB
0 143
下载积分: 2 下载次数: 1

代码说明:

机器学习算法之knn回归的C++语言实现;机器学习经典算法的简单实现;距离使用的是欧式距离或者余弦距离;误差优化;knn分类算法原理类似;

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

发表评论

0 个回复

  • c#读取wince中的ini文件
    由于wince中不支持读取ini的函数,自己编写的读取的类
    2014-12-07下载
    积分:1
  • MCP23S08
    MCP23S08 SPI code test
    2021-02-02 10:20:01下载
    积分:1
  • INA260CODE_V1zh±版本双向
    说明:  IN260采集电流,利用I2C通信,读操作,写操作,各个寄存器的用法(IN260 collects current, uses I2C communication, read operation, write operation, the use of registers)
    2020-06-18 03:00:02下载
    积分:1
  • MISRA-C-2004_工业标准的C编程规范_中文版
    规则都是针对的是C语言本身缺陷或容易被误解的点,如:自动变量如果不初始化就使用会出现随机值、不同类型数据赋值容易出现的隐式转换;没有包含诸如注释、变量名、编码格式等统一编程风格的内容。(The rules are for the C language itself is defective or misunderstood, such as: if you do not use the automatic variable initialization will appear random values, implicit prone to different types of data assignment conversion; does not contain such as comments, variable names, encoding format unified programming style content.)
    2017-08-22 15:30:28下载
    积分:1
  • jingtailuyousuanfa
    静态路由算法,也就是大家熟知的Dijkstra算法,对大家学习非常有用!(Static routing algorithm, which is well-known Dijkstra algorithm, learning is very useful for all of us!)
    2007-11-23 22:19:39下载
    积分:1
  • ex-06
    说明:  fluent修改材料属性(粘度)UDF案例(fluent文件及UDF源代码)(UDF case of modifying material properties (viscosity) by fluent (fluent file and UDF source code))
    2020-12-05 18:43:46下载
    积分:1
  • zcpa
    说明:  过零峰值幅度(ZCPA:Zero-cro ingwithPeakAmplitude)特征的语音识别系统,它是基于人耳的听觉模型建立起来的,这是ZCPA的源程序。(Zero-crossing peak amplitudes (ZCPA: Zero-cro ingwithPeakAmplitude) features voice recognition system, which is based on the model of the human ear)
    2021-02-26 10:39:37下载
    积分:1
  • 09DesingPattern
    说明:  基于图像处理的QR码解码技术,并对QR码解码算法进行详细设计与改进(QR decoding technology based on image processing and detailed design and improvement of QR decoding algorithm)
    2019-05-16 20:39:37下载
    积分:1
  • 最优平行轨道车皮排序问题« 编程任务:给定正整数n,和n个车皮的初始编号n a , a , ,a 1 2 L ,编程计算最少需要多少个平行轨道才能按...
    最优平行轨道车皮排序问题« 编程任务:给定正整数n,和n个车皮的初始编号n a , a , ,a 1 2 L ,编程计算最少需要多少个平行轨道才能按照规则(1)和(2)调度车皮,使车皮在车皮出口按照1,2,…,n的顺序输出。« 数据输入:由文件input.txt 给出输入数据。第1 行有1 个正整数n,表示有n 个车皮。第2 行是n个车皮的初始编号n a , a , ,a 1 2 L 。-optimal parallel tracks wagon laquo scheduling problem; Programming tasks : Given a positive integer n, and n cars of the initial numbers n a, a,, a 1 2 L, programming calculations need at least the number of parallel tracks can be in accordance with the rules (1) and (2) Scheduling wagon, the wagon wagon with exports 1,2, ..., n output in the order. Laquo; Data input : from the document input.txt given input data. The first line is a positive integer n, n said a wagon. Line 2 n wagon is the initial numbers n a, a,, a 1 2 L.
    2022-08-15 06:43:38下载
    积分:1
  • 趋势头皮-点差要求不高-建议H1
    这是一个头皮EA 用在H1 不需要低延迟,因为是做1小时周期(This is a scalp EA for H1)
    2021-02-27 10:39:36下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载