python--决策树2

1.计算香农熵：
dataSet = [[0, 0, 0, 0, ‘no’],
[0, 0, 0, 1, ‘no’],
[0, 1, 0, 1, ‘yes’],
[0, 1, 1, 0, ‘yes’],
[0, 0, 0, 0, ‘no’],
[1, 0, 0, 0, ‘no’],
[1, 0, 0, 1, ‘no’],
[1, 1, 1, 1, ‘yes’],
[1, 0, 1, 2, ‘yes’],
[1, 0, 1, 2, ‘yes’],
[2, 0, 1, 2, ‘yes’],
[2, 0, 1, 1, ‘yes’],
[2, 1, 0, 1, ‘yes’],
[2, 1, 0, 2, ‘yes’],
[2, 0, 0, 0, ‘no’]]
labels = [‘年龄’, ‘有工作’, ‘有自己的房子’, ‘信贷情况’]
numEntires=len(dataSet)
print(numEntires)
labelCounts={}
for featVec in dataSet:
print(featVec)
currentLabel=featVec[-1]
print(currentLabel)
结果：15
[0, 0, 0, 0, ‘no’]
no
[0, 0, 0, 1, ‘no’]
no
[0, 1, 0, 1, ‘yes’]
yes
[0, 1, 1, 0, ‘yes’]
yes
[0, 0, 0, 0, ‘no’]
no
[1, 0, 0, 0, ‘no’]
no
[1, 0, 0, 1, ‘no’]
no
[1, 1, 1, 1, ‘yes’]
yes
[1, 0, 1, 2, ‘yes’]
yes
[1, 0, 1, 2, ‘yes’]
yes
[2, 0, 1, 2, ‘yes’]
yes
[2, 0, 1, 1, ‘yes’]
yes
[2, 1, 0, 1, ‘yes’]
yes
[2, 1, 0, 2, ‘yes’]
yes
[2, 0, 0, 0, ‘no’]
no