-
决策树的概念:
顾名思义以树的形式判断决策,实质上和一个‘读心术’的游戏类似,提问者可以问n个问题,回答者只能回答是和否,
通过n次的回答,最终得到结论。
-
决策树的构建:
import numpy as np
#导入画图工具
import matplotlib.pyplot as plt
from matplotlib.colors import ListedColormap
from sklearn import tree,datasets
from sklearn.model_selection import train_test_split
wine = datasets.load_wine()
X = wine.data[:,:2]#只取前2个属性
y = wine.target
X_train,X_test,y_train,y_test = train_test_split(X,y)
clf = tree.DecisionTreeClassifier(max_depth=5)
clf.fit(X_train,y_train)
print(clf.predict_proba([[0.11,0.28]]))
print(clf.score(X_train,y_train))
X的2个属性即为问题,决策树的深度即为n,y的值即为最终结论。
-
图形显示:
cmap_light = ListedColormap(['#FFAAAA','#AAFFAA','#AAAAFF'])
cmap