深度学习最邻近规则 python实现
来源:互联网 发布:dmx控制器淘宝 编辑:程序博客网 时间:2024/06/16 12:48
- 1.
# -*- coding: utf-8 -*- """ Created on Wed May 11 22:52:29 2016 @author: sanmao """ import random import math import operator def loadDataset(filename,split,trainingSet=[],testSet=[]): with open(filename,'rb') as csvfile: lines = csv.reader(csvfile) dataest = list(lines) for x in range(len(dataset)-1): for y in range(4): dataset[x][y] = float(dataset[x][y]) if random.random() < split: trainingSet.append(dataset[x]) else: testSet.append(dataset[x]) def euclideanDistance(instance1,instance2,length): distance = 0 for x in range(length): distance += pow((instance1[x] - instance2[x]),2) return math.sqrt(distance) def getNeighbors(trainingSet,testInstance,k): distances = [] length = len(testInstance)-1 for x in range(len(trainingSet)): dist = euclideanDistance(testInstance,trainingSet[x],length) distances.append((trainingSet[x],dist)) distances.sort(key=operator.itemgetter(1)) neighbors = [] for x in range(k): neighbors.append(distances[x][0]) return neighbors def getResponse(neighbors): classVotes = {} for x in range(len(neighbors)): response = neighbors[x][-1] if response in classVotes: classVotes[response] += 1 else: classVotes[response] = 1 sortedVotes = sorted(classVotes.iteritems(),key=operator.itemgetter(1),reverse=True) return sortedVotes[0][0] def getAccuracy(testSet,predictions): corrrect = 0 for x in range(len(testSet)): if testSet[x][-1] == predictions[x]: correct += 1 return (corrrect/float(len(testSet))) * 100.0 def main(): trainingSet=[] testSet=[] split = 0.67 loadDataset(r'D',split,trainingSet,testSet) print('Train set:'+repr(len(trainingSet))) print('Test set:'+repr(len(testSet))) predictions=[] k = 3 for x in reange(len(testSet)): neighbors = getNeighbors(trainingSet,testSet[x],k) result = getResponse(neighbors) predictions.append(result) print('>predicted='+repr(result)+',actual='+repr(testSet[x][-1])) accuracy = getAccuracy(testSet,predictions) print('Accuracy:'+repr(accuracy)+'%') main()
0 0
- 深度学习最邻近规则 python实现
- KNN最邻近规则分类算法实践实现【Python实现】
- 2-2 Python实现最邻近规则KNN分类应用
- 机器学习分类篇-最邻近规则分类KNN
- 机器学习(四)最邻近规则分类
- 机器学习分类篇-最邻近规则分类KNN
- 机器学习---最邻近规则分类KNN(k-NearestNeighbor)算法
- KNN 最邻近规则分类
- tensorflow 学习笔记1-最邻近实现(NN)
- 最邻近规则分类算法(KNN)
- 深度学习*学习笔记---之最邻近算法KNN(2)
- 机器学习与深度学习(二) k最邻近分类算法 (K-Nearest Neighbor) KNN
- 机器学习算法:kNN(K-Nearest Neighbor)最邻近规则分类
- 机器学习——最邻近规则分类(K Nearest Neighbor)KNN算法
- 机器学习——最邻近规则分类(K Nearest Neighbor)KNN算法的应用
- 机器学习第二个算法KNN(最邻近规则分类KNN算法)
- K-Nearest Neighbor(KNN) 最邻近分类算法及Python实现方式
- kNN(K-Nearest Neighbor)最邻近规则分类
- 对照Java学习Swift--协议(Protocols)
- miniblink滚轮太慢bug修复
- MySql Service 安装流程,包含解决服务无法启动 服务没有报告任何错误
- 服务器TIME_WAIT和CLOSE_WAIT详解和解决办法
- Android-injustdecodebounds实现对大图压缩
- 深度学习最邻近规则 python实现
- Domain Transform for Edge-Aware Image and Video Processing - 论文阅读
- eclipse安装配置github插件egit
- 《页面制作》课程学习摘要
- telnet命令的安装
- Java 序列化机制(二) -- 控制序列化的兼容性
- RHEL7重定向和文件查找
- multimap用法
- 2016 UESTC Training for Dynamic Programming F - 柱爷与三叉戟不得不说的故事 压位dp