lklearn之knn算法分类实例

knn算法:在训练集中取前n个距离目标最近的点,统计这些点的类别,哪个类别出现的次数最多,则数据属于哪一类

代码:

from __future__ import print_function
from numpy import *
import operator
import csv
from sklearn import datasets
from sklearn.cross_validation import train_test_split
from sklearn.neighbors import KNeighborsClassifier
def file2matrix(filename):
    Mat = zeros((1000,20))
    label = []
    index = 0
    t = 0
    with open(filename,"r",encoding="utf-8") as csvfile:
        read = csv.reader(csvfile)
        for i in read:
            if t ==0 :
                t=t+1
                continue
            else:
                Mat[index,:] = i[0:20]
                label.append(i[20])
                index = index + 1
    return Mat,label
normMat,datingLabels = file2matrix("1.csv")
errorcount = 0;
X_train, X_test, y_train, y_test = train_test_split(normMat,datingLabels, test_size=0.3)
knn = KNeighborsClassifier()
knn.fit(X_train,y_train)
for i in range(300):
    if(knn.predict(X_test)[i]!=y_test[i]):
        errorcount=errorcount+1
print(errorcount/300)

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值