<PY>kNN
来源:互联网 发布:淘宝刷手是什么意思 编辑:程序博客网 时间:2024/04/27 08:50
k近邻算法
trainningData=[(2,3,'r'),(3,4,'r'),(3,4.3,'r'),(1,2,'r'),(3,1,'r'),(3,2.1,'r'),(2,2,'r'),(1,3,'r'),(1,1.5,'r'),(4,2,'r'),(7,3,'g'),(8,2,'g'),(9,2.5,'g'),(9,3,'g'),(8.2,1,'g'),(7.1,3.1,'g'),(6,6,'g'),(7,4,'g'),(8,2.3,'g'),(9,5.2,'g'),(7.5,2.3,'g')]# import matplotlib.pyplot as plt# plt.figure()# [plt.scatter([td[0]],[td[1]],color=td[2]) for td in trainningData]# plt.show()distance=lambda x1,x2,p=2:sum([abs(x1[i]-x2[i])**p for i in range(len(x1))])**(1.0/p) if len(x1)==len(x2) else "length not match"# def distanceDict(testD,traiD):# distDict={}# for i in range(len(traiD)):# distDict[i]=distance(testD,traiD[i][:-1])kClasses=lambda testD,traiD,k:[traiD[distDict[0]][-1] for distDict in sorted({i:distance(testD,traiD[i][:-1]) for i in range(len(traiD))}.items(),key=lambda x:x[1],reverse=False)[:k]] # distinct,non-repeatable is indexdef findClass(testD,traiD,k): cs=kClasses(testD,traiD,k) ss=list(set(cs)) counts=[cs.count(c) for c in ss] return ss[counts.index(max(counts))]print(findClass((2,1.3),trainningData,k=5))
1 0
- <PY>kNN
- knn
- knn
- KNN
- KNN
- KNN
- KNN
- KNN
- knn
- KNN
- knn
- kNN
- KNN
- KNN
- KNN
- KNN
- knn
- KNN
- 32位与4G内存限制
- Bootstrap CSS——导航
- 抽象类与接口
- Bootstrap CSS——导航条
- Android常见分辨率及屏幕适配注意事项
- <PY>kNN
- 黑马程序员——4.继承(接口、多态、内部类、异常、包)
- JavaScript 模块
- sencha touch 在新版谷歌浏览器中painted事件无法触发解决方案以及carousel 控件、togglefield控件、滚动条失效
- C#学习之多线程开发技术(十)
- 一段好玩的程序
- 对某个Android应用的某一功能测试
- UVA11971 - Polygon
- 项目33.1利用循环求和