摘要：# coding:utf-8 from numpy import * def loadDataSet(): postingList=[['my', 'dog', 'has', 'flea', 'problems', 'help', 'please'], ['maybe', 'not', 'take' 阅读全文

摘要：def storeTree(inputTree,filename): import pickle; fw=open(filename,'w'); pickle.dump(inputTree,fw); fw.close(); def grabTree(filename): import pickle; 阅读全文

摘要：import matplotlib.pyplot as plt decisionNode=dict(boxstyle="sawtooth",fc="11.8"); leafNode=dict(boxstyle="round4",fc="0.8"); arrow_args=dict(arrowstyl 阅读全文

摘要：from math import log import operator def calcShannonEnt(dataSet): numEntries=len(dataSet); lableCounts={}; for featVec in dataSet: currentLabel=featVe 阅读全文

摘要：from numpy import * import operator from os import listdir def classify0(inX, dataSet, labels, k): dataSetSize = dataSet.shape[0] diffMat = tile(inX, (dataSetSize,1)) - dataSet sqDiffMat ... 阅读全文

摘要：from numpy import * import operator from os import listdir def file2matrix(filename): fr= open(filename); #打开文件 arrayline=fr.readlines(); #把文件的每一行都读进去 numberoflines=len(arrayli... 阅读全文

摘要：kNN算法 K近邻 简单说就是找出最近的K个点然后找出他们的分类最多的就是本身 from numpy import * #导入包numpy import operator #运算符 def createDataSet(): #这个是生成一开始的点以及他们的类型 也可以叫做参照 group=array 阅读全文