qq_18617299的博客

#!/usr/bin/python #-*-coding:utf-8 -*- from mathimport log def createDataSET():     dataSet=[[1,1,"yes"],              [1,1,"yes"],              [1,0,"no"],              [0,1,"no"],

#!/usr/bin/python #-*-coding:utf-8 -*- #贝叶斯实现 def createDataSET(): dataSet=[[1,"S",-1], [1,"M",-1], [1,"M",1], [1,"S",1], [1,"S",-1],

#!/usr/bin/python #-*-coding:utf-8 -*- #决策树的剪枝算法 import ID3alogorithem as id3 from math import log # myTree数据类型 {'no surfacing': {0: 'no', 1: {'flippers': {0: 'no', 1: 'yes'}}}} #计算每个结点的经验熵 def eachN

#!/usr/bin/python #-*-coding:utf-8 -*- import random from numpy import * import numpy as np def training(): train_data1 = [[3, 3, 1], [4, 3, 1]] # 正样本 train_data2 = [[1, 1, -1]] # 负样本 t

# -*- coding: utf-8 -*- from math import sqrt from numpy import * def createDataSet(): group = array([[1.0,1.1],[1.0,1.0],[0,0],[0,0.1]]) labels = ['A','A','B','B'] return group, labels ...

#!/usr/bin/python #-*-coding:utf-8 -*- #贝叶斯实现 def createDataSET(): dataSet=[[1,"S",-1], [1,"M",-1], [1,"M",1], [1,"S",1], [1,"S",-1], ...